Distance Metric Learning using Graph Convolutional Networks: Application to Functional Brain Networks
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.
Code (3)
Tasks
Graph SimilarityMetric LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Molecular distance matrix prediction based on graph convolutional networks
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…
PredictionDistance-Geometric Graph Convolutional Network (DG-GCN) for Three-Dimensional (3D) Graphs
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-…
TranslationOptimal Transport for structured data with application on graphs
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 AnalysisConvolutional Set Matching for Graph Similarity
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 matchingEuclidean Embedding of Data Using Local Distances
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…