SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering
Summary: SBSC: self-tuned, parameter-free bipartite graph for spectral clustering with locality sparsification, selecting O(sqrt(N)) representatives. Bi-means/K-means pick reps in O(N log N); local neighbor search yields an O(N)-sized graph and O(N(K^2+log N)) clustering time, with faster, higher-quality results on large data. (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. Abdul Atif Khan (PDPM Indian Institute of Information Technology, Design and Manufacturing)
- 2. Rashmi Maheshwari (PDPM Indian Institute of Information Technology, Design and Manufacturing)
- 3. Mohammad Maksood Akhter (PDPM Indian Institute of Information Technology, Design and Manufacturing)
- 4. Sraban Kumar Mohanty (PDPM Indian Institute of Information Technology, Design and Manufacturing)
BibTeX Citation
@inproceedings{khan_sigmod25,
title = {{SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering}},
author = {Khan, Abdul Atif and Maheshwari, Rashmi and Akhter, Mohammad Maksood and Mohanty, Sraban Kumar},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725418},
url = {https://dl.acm.org/doi/10.1145/3725418},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,380 | SCAR — Spectral Clustering Accelerated and Robustified | 2022 | VLDB | 6.2397041e-05 |
| 6,956 | A New Sparse Data Clustering Method Based On Frequent Items | 2023 | SIGMOD | 5.7303405e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,294 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD |
| 2 | 3,616 | Parallel Local Graph Clustering | 2016 | VLDB |
| 3 | 11,102 | The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering | 2025 | VLDB |
| 4 | 11,675 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD |
| 5 | 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD |
| 6 | 3,511 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 7 | 364 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 8 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 9 | 8,739 | Biclustering and Boolean Matrix Factorization in Data Streams | 2020 | VLDB |
| 10 | 11,163 | Efficient High-Quality Clustering for Large Bipartite Graphs | 2024 | SIGMOD |