Research map / Graph learning / Graph algorithms and clustering
Graph Matching with Partially-Correct Seeds
Liren Yu, Jiaming Xu, Xiaojun Lin
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use 2-hop witnesses instead of 1-hop witnesses | seeded graph matching · Synthetic correlated Erdos-Renyi (n=10000, s=0.9) | accuracy rate | Improved |
| use 2-hop algorithm instead of NoisySeeds with best threshold r | 2-hop algorithm · Synthetic correlated Erdos-Renyi (n=10000, s=0.9) | accuracy rate | Improved |
| add iterations (L=0,1,2) reusing previous output as seeds (ablation) | 2-hop algorithm · Synthetic correlated Erdos-Renyi, p=n^(-6/7) | matching accuracy: close to 1 vs 0.8~0.9 for NoisySeeds | Improved |
| use 2-hop algorithm instead of 1-hop and NoisySeeds | 2-hop algorithm · Facebook networks | matching accuracy | Improved |
| use 2-hop algorithm instead of 1-hop and NoisySeeds | 2-hop algorithm · Autonomous Systems graphs (beta=0.3,0.6,0.9) | matching accuracy | Improved |
| use 2-hop instead of 1-hop on top of GRAMPA seeds | 2-hop algorithm · SHREC'16 deformable shapes | fraction of correctly matched vertices: more than 80% vs around 60% vs around 30% | Improved |
| use 2-hop instead of 1-hop algorithm | 2-hop algorithm · Synthetic, n=10000, beta=0.5 | running time: 52s -> 86s | Hurt |
Closest papers by meaning
- Seeded Graph Matching for the Correlated Gaussian Wigner Model via the Projected Power Method (JMLR 2024 · similarity 0.91)
- Graph Matching: Relax at Your Own Risk (TPAMI 2016 · similarity 0.90)
- SeedGNN: Graph Neural Network for Supervised Seeded Graph Matching (ICML 2023 · similarity 0.90)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.88)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.88)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
