Research map / Learning theory and algorithms / Clustering
Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques
Debarghya Ghoshdastidar, Ambedkar Dukkipati
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 TTM instead of HOSVD | spectral hypergraph partitioning · Planted m-uniform hypergraph, k=2, p=0.1, n from 10 to 100 | mean number of mis-clustered vertices | Improved |
| use TTM instead of NH-Cut | spectral hypergraph partitioning · Planted m-uniform hypergraph, k=2, p=0.1, n from 10 to 100 | mean number of mis-clustered vertices | No clear effect |
| reduce probability gap p from 0.1 to 0.05 and 0.025 | HOSVD · Planted 3-uniform hypergraph bi-partitioning (q=0.2, 50 runs) | mis-clustered vertices: error varies as 1/p^4 | Hurt |
| reduce probability gap p from 0.1 to 0.05 and 0.025 | TTM · Planted 3-uniform hypergraph bi-partitioning (q=0.2, 50 runs) | mis-clustered vertices: error varies as 1/p^2 | Hurt |
| use TTM instead of SNTF and hMETIS | hypergraph partitioning · Planted 3-uniform hypergraph, k=3, q=0.2, 50 runs | fractional clustering error | Improved |
| use TTM instead of HGT | hypergraph partitioning · Planted 3-uniform hypergraph, k=3, q=0.2, 50 runs | fractional clustering error | Improved |
| increase noise level sigma_a in line clustering | all hypergraph partitioning methods · Noisy points from three intersecting lines in 3-D | fractional clustering error | Hurt |
Closest papers by meaning
- Clustering with Hypergraphs: The Case for Large Hyperedges (TPAMI 2016 · similarity 0.90)
- Inhomogeneous Hypergraph Clustering with Applications (NeurIPS 2017 · similarity 0.90)
- Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets (TPAMI 2026 · similarity 0.88)
- Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling (AAAI 2017 · similarity 0.87)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.86)
- When Hypergraph Meets Heterophily: New Benchmark Datasets and Baseline (AAAI 2025 · similarity 0.85)
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.
