Research map / Learning theory and algorithms / Matrix and tensor methods
A CUR Decomposition-Based Mix-Order Framework for Large-Scale Hypergraph Matching
Qixuan Zheng, Ming Zhang, Hong Yan
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
- CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition (CVPR 2024 · similarity 0.96)
- Tensor Power Iteration for Multi-Graph Matching (CVPR 2016 · similarity 0.88)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.84)
- Position: Graph Matching Systems Deserve Better Benchmarks (ICML 2025 · similarity 0.84)
- Hypergraph Learning for Unsupervised Graph Alignment via Optimal Transport (AAAI 2025 · similarity 0.84)
- Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN (NeurIPS 2025 · similarity 0.84)
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.
