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
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 |
|---|---|---|---|---|
| 4,763 | SCAR — Spectral Clustering Accelerated and Robustified | 2022 | VLDB | 5.9395463e-05 |
| 5,996 | A New Sparse Data Clustering Method Based On Frequent Items | 2023 | SIGMOD | 5.2415551e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 5.5194222e-05 |
| 3,597 | Parallel Local Graph Clustering | 2016 | VLDB | 6.9345175e-05 |
| 10,879 | The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering | 2025 | VLDB | 4.1945683e-05 |
| 11,477 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1945683e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 313 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00028097557 |
| 2,542 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB | 8.5794502e-05 |
| 777 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.0001679862 |
| 8,535 | Biclustering and Boolean Matrix Factorization in Data Streams | 2020 | VLDB | 4.4937074e-05 |
| 10,945 | Efficient High-Quality Clustering for Large Bipartite Graphs | 2024 | SIGMOD | 4.1945683e-05 |