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 (Chinese University of Hong Kong)
- 2. Miao Qiao (University of Auckland)
- 3. Hong Cheng (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{feng_sigmod23,
title = {{Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation}},
author = {Feng, Zijin and Qiao, Miao and Cheng, Hong},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3617335},
url = {https://dl.acm.org/doi/10.1145/3617335},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,082 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.892229e-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,692 | A Model-based Approach to Attributed Graph Clustering | 2012 | SIGMOD | 8.1241746e-05 |
| 5,329 | A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks | 2009 | VLDB | 6.1775042e-05 |
| 10,328 | On Scalable Computation of Graph Eccentricities | 2022 | SIGMOD | 5.0333462e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 645 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD |
| 2 | 4,314 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB |
| 3 | 10,806 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 4 | 10,261 | Efficient High-Quality Clustering for Large Bipartite Graphs | 2024 | SIGMOD |
| 5 | 5,599 | MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs | 2020 | VLDB |
| 6 | 3,539 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB |
| 7 | 9,474 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 8 | 8,359 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |
| 9 | 11,446 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 10 | 6,082 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD |