Research map / Learning theory and algorithms / Clustering
Clustering with Hypergraphs: The Case for Large Hyperedges
Pulak Purkait, Tat-Jun Chin, Alireza Sadri, David Suter
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
- Inhomogeneous Hypergraph Clustering with Applications (NeurIPS 2017 · similarity 0.90)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.90)
- Hypergraph Learning for Unsupervised Graph Alignment via Optimal Transport (AAAI 2025 · similarity 0.86)
- Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach (NeurIPS 2025 · similarity 0.86)
- A Non-parametric Graph Clustering Framework for Multi-View Data (AAAI 2024 · similarity 0.86)
- Hypergraph Vision Transformers: Images are More than Nodes, More than Edges (CVPR 2025 · similarity 0.86)
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.
