Graph Matching via Optimal Transport
The graph matching problem seeks to find an alignment between the nodes of two graphs that minimizes the number of adjacency disagreements. Solving the graph matching is increasingly important due to it's applications in operations research, computer vision, neuroscience, and more. However, current state-of-the-art algorithms are inefficient in matching very large graphs, though they produce good accuracy. The main computational bottleneck of these algorithms is the linear assignment problem, which must be solved at each iteration. In this paper, we leverage the recent advances in the field of optimal transport to replace the accepted use of linear assignment algorithms. We present GOAT, a modification to the state-of-the-art graph matching approximation algorithm "FAQ" (Vogelstein, 2015), replacing its linear sum assignment step with the "Lightspeed Optimal Transport" method of Cuturi (2013). The modification provides improvements to both speed and empirical matching accuracy. The effectiveness of the approach is demonstrated in matching graphs in simulated and real data examples.
Code (1)
Tasks
Graph MatchingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Robust Graph Matching Using An Unbalanced Hierarchical Optimal Transport Framework
Graph matching is one of the most significant graph analytic tasks, which aims to find the node correspondence across different graphs. Most existing graph matching approaches mainly rely on topological information, whos…
cross-modal alignmentGraph MatchingBilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport
Bilingual lexicons form a critical component of various natural language processing applications, including unsupervised and semisupervised machine translation and crosslingual information retrieval. We improve bilingual…
Bilingual Lexicon InductionGraph MatchingInformation RetrievalMachine Translation+2BOTM: Echocardiography Segmentation via Bi-directional Optimal Token Matching
Existed echocardiography segmentation methods often suffer from anatomical inconsistency challenge caused by shape variation, partial observation and region ambiguity with similar intensity across 2D echocardiographic se…
AnatomySegmentationBilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport
Bilingual lexicons form a critical component of various NLP applications, including unsupervised and semisupervised machine translation and crosslingual information retrieval. In this work, we improve bilingual lexicon i…
Bilingual Lexicon InductionGraph MatchingInformation RetrievalMachine Translation+2Optimal Transport on Discrete Domains
Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surf…