Research map / Learning theory and algorithms / Clustering
Inhomogoenous Hypergraph Clustering with Applications
Pan Li, Olgica Milenkovic
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 the fan motif with inhomogeneous weights instead of homogeneous triangle motifs | Hypergraph clustering on the Florida Bay foodweb · Florida Bay foodweb | vertex coverage: 62 out of 128 -> 127 out of 128 | Improved |
| Use the fan motif with inhomogeneous weights rather than homogeneous weights (ablation) | Fan-motif clustering on the Florida Bay foodweb · Florida Bay foodweb | hierarchical structure recovery | Improved |
| Use the fan motif with inhomogeneous weights rather than homogeneous triangle motifs | Hypergraph clustering on the Florida Bay foodweb · Florida Bay foodweb | number of clusters: four -> five | Mixed |
Closest papers by meaning
- Inhomogeneous Hypergraph Clustering with Applications (NeurIPS 2017 · similarity 0.88)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.86)
- Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach (NeurIPS 2025 · similarity 0.85)
- A Non-parametric Graph Clustering Framework for Multi-View Data (AAAI 2024 · similarity 0.82)
- Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning (ICML 2024 · similarity 0.82)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.81)
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.
