Research map / Graph learning / Graph algorithms and clustering
Learning With Partial and Noisy Correspondence in Graph Matching
Yijie Lin, Mouxing Yang, Peng Hu, Jiancheng Lv, Hao Chen, Xi Peng
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Graph Matching with Bi-level Noisy Correspondence (ICCV 2023 · similarity 0.91)
- Deep Learning of Partial Graph Matching via Differentiable Top-K (CVPR 2023 · similarity 0.90)
- Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization (TPAMI 2016 · similarity 0.89)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.89)
- Neural Graph Matching Network: Learning Lawler’s Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching (TPAMI 2021 · similarity 0.89)
- Zero-Assignment Constraint for Graph Matching With Outliers (CVPR 2020 · 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.
