paper-with-me

홈 › Papers

Distance Metric Learning using Graph Convolutional Networks: Application to Functional Brain Networks

2017-03-07 · Sofia Ira Ktena, Sarah Parisot, Enzo Ferrante, Martin Rajchl, Matthew Lee, Ben Glocker, Daniel Rueckert

Evaluating similarity between graphs is of major importance in several computer vision and pattern recognition problems, where graph representations are often used to model objects or interactions between elements. The choice of a distance or similarity metric is, however, not trivial and can be highly dependent on the application at hand. In this work, we propose a novel metric learning method to evaluate distance between graphs that leverages the power of convolutional neural networks, while exploiting concepts from spectral graph theory to allow these operations on irregular graphs. We demonstrate the potential of our method in the field of connectomics, where neuronal pathways or functional connections between brain regions are commonly modelled as graphs. In this problem, the definition of an appropriate graph similarity function is critical to unveil patterns of disruptions associated with certain brain disorders. Experimental results on the ABIDE dataset show that our method can learn a graph similarity metric tailored for a clinical application, improving the performance of a simple k-nn classifier by 11.9% compared to a traditional distance metric.

📄 PDF Abstract BibTeX arXiv:1703.02161

Code (3)

sk1712/gcn_metric_learning 공식 구현 tf
sheryl-ai/MVGCN tf
sheryl-ai/MemGCN tf

Tasks

Graph SimilarityMetric Learning

Methods 이 논문이 사용한 방법론

k-NN $k$-Nearest Neighbors is a clustering-based algorithm for classification and regression. It is a a type of instance-based learning as it does not attempt to construct a…

Similar Papers 제목 키워드 기반

Molecular distance matrix prediction based on graph convolutional networks

2021-07-01 · Xiaohui Lin, Yongquan Jiang, Yan Yang

Molecular structure has important applications in many fields. For example, some studies show that molecular spatial information can be used to achieve better prediction results when predicting molecular properties. Howe…

Prediction

Distance-Geometric Graph Convolutional Network (DG-GCN) for Three-Dimensional (3D) Graphs

2020-07-06 · Daniel T. Chang

The distance-geometric graph representation adopts a unified scheme (distance) for representing the geometry of three-dimensional(3D) graphs. It is invariant to rotation and translation of the graph and it reflects pair-…

Translation

Optimal Transport for structured data with application on graphs

2018-05-23 · Titouan Vayer, Laetitia Chapel, Rémi Flamary, Romain Tavenard 외

This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space. We consider a new transportation distance (i.e. t…

ClusteringGraph ClassificationGraph ClusteringTime Series Analysis

Convolutional Set Matching for Graph Similarity

2018-10-23 · Yunsheng Bai, Hao Ding, Yizhou Sun, Wei Wang

We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity co…

Graph Similarityset matching

Euclidean Embedding of Data Using Local Distances

2026-05-19 · Dimitris Arabadjis arxiv

We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neig…