Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation
Summary: AHCKA employs KNN augmentation to leverage node attributes in hypergraphs for improved attributed hypergraph clustering. A joint hypergraph random-walk objective plus a fast solver yields state-of-the-art results with massive speedups on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yiran Li
- 2. Renchi Yang
- 3. Jieming Shi
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,827 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.3113542e-05 |
| 10,732 | Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges | 2025 | VLDB | 4.1945683e-05 |
| 13,086 | Effective Clustering for Large Multi-Relational Graphs | 2026 | SIGMOD | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 313 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00028097557 |
| 2,537 | BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart | 2017 | SIGMOD | 8.5834428e-05 |
| 2,807 | A Model-based Approach to Attributed Graph Clustering | 2012 | SIGMOD | 8.0905959e-05 |
| 5,478 | MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs | 2020 | VLDB | 5.4851612e-05 |
Previous
Page 1 / 1
Next