Seeded Graph Matching

09/03/2012
by   Donniell E. Fishkind, et al.
0

Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matching problem is the graph matching problem when we are first given a partial alignment that we are tasked with completing. In this paper, we modify the state-of-the-art approximate graph matching algorithm "FAQ" of Vogelstein et al. (2015) to make it a fast approximate seeded graph matching algorithm, adapt its applicability to include graphs with differently sized vertex sets, and extend the algorithm so as to provide, for each individual vertex, a nomination list of likely matches. We demonstrate the effectiveness of our algorithm via simulation and real data experiments; indeed, knowledge of even a few seeds can be extremely effective when our seeded graph matching algorithm is used to recover a naturally existing alignment that is only partially observed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/28/2021

Random Graph Matching with Improved Noise Robustness

Graph matching, also known as network alignment, refers to finding a bij...
research
01/16/2014

Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability

We present a novel approximate graph matching algorithm that incorporate...
research
01/31/2023

Population-wise Labeling of Sulcal Graphs using Multi-graph Matching

Population-wise matching of the cortical fold is necessary to identify b...
research
08/17/2016

Multi-Person Tracking by Multicut and Deep Matching

In [1], we proposed a graph-based formulation that links and clusters pe...
research
05/01/2017

Vertex Nomination Via Local Neighborhood Matching

Consider two networks on overlapping, non-identical vertex sets. Given v...
research
07/05/2023

Gaussian Database Alignment and Gaussian Planted Matching

Database alignment is a variant of the graph alignment problem: Given a ...
research
11/25/2013

Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching

Graph matching is a challenging problem with very important applications...

Please sign up or login with your details

Forgot password? Click here to reset