Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation
Summary: Introduces HEM, a non-AON random hypergraph model, with PI for hyperedge-cluster quality. Proposes PIC and computation optimizations, achieving scalable modularity-based hypergraph clustering and up to 5 orders of magnitude faster than baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zijin Feng
- 2. Miao Qiao
- 3. Hong Cheng
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,608 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.4108528e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,810 | A Model-based Approach to Attributed Graph Clustering | 2012 | SIGMOD | 8.085151e-05 |
| 3,813 | A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks | 2009 | VLDB | 6.7324289e-05 |
| 9,951 | On Scalable Computation of Graph Eccentricities | 2022 | SIGMOD | 4.236537e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 773 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.00016788213 |
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 5,599 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB | 5.4164926e-05 |
| 10,948 | Efficient High-Quality Clustering for Large Bipartite Graphs | 2024 | SIGMOD | 4.1905499e-05 |
| 5,468 | MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs | 2020 | VLDB | 5.4896448e-05 |
| 5,529 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 5.4569473e-05 |
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.380727e-05 |
| 7,815 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD | 4.640481e-05 |
| 10,875 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1905499e-05 |
| 5,608 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.4108528e-05 |