Efficient High-Quality Clustering for Large Bipartite Graphs
Summary: Efficient k-BGC on large bipartite graphs with HOPE/HOPE+, using HOP vectors and low-rank approximations for quality clustering. HOPE+ (FNEM/SNEM) achieves top accuracy with two-stage optimization, scaling to 1.1B edges in ~31 minutes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Renchi Yang (Hong Kong Baptist University)
- 2. Jieming Shi (Hong Kong Polytechnic University)
BibTeX Citation
@inproceedings{yang_sigmod24,
title = {{Efficient High-Quality Clustering for Large Bipartite Graphs}},
author = {Yang, Renchi and Shi, Jieming},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3639278},
url = {https://dl.acm.org/doi/10.1145/3639278},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,939 | BiLink: Bidirectional Meta-paths for Link Discovery in Billion-Scale Heterogeneous Graphs | 2026 | VLDB | 4.9793485e-05 |
| 13,579 | Effective Clustering for Large Multi-Relational Graphs | 2026 | SIGMOD | - |
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 |
|---|---|---|---|---|
| 32 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00049737458 |
| 1,835 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB | 9.5368647e-05 |
| 5,562 | Scalable and Effective Bipartite Network Embedding | 2022 | SIGMOD | 6.0841762e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,209 | SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering | 2025 | SIGMOD |
| 2 | 13,579 | Effective Clustering for Large Multi-Relational Graphs | 2026 | SIGMOD |
| 3 | 9,865 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD |
| 4 | 10,665 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 5 | 5,562 | Scalable and Effective Bipartite Network Embedding | 2022 | SIGMOD |
| 6 | 10,860 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB |
| 7 | 6,082 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD |
| 8 | 5,629 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 9 | 8,359 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |
| 10 | 3,574 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |