The core problem, the authors explain, lies in the standard three-step pipeline that most graph clustering algorithms follow. First, an n-by-n similarity graph is constructed, where n is the number of data points. Second, the algorithm performs an eigenvalue decomposition (EVD) of that graph to obtain a spectral embedding. Third, the continuous embedding is discretized, typically with k-means or spectral rotation, to produce final cluster assignments. Each step is expensive. Building the graph costs on the order of n squared operations, and the eigenvalue decomposition on a dense graph costs on the order of n cubed. For a dataset with a million points, those scalings translate into computations that are simply out of reach. The survey’s central contribution is to organize the many acceleration strategies that have emerged into a coherent taxonomy, splitting them into single-view and multi-view families, and within each family into large graph methods and bipartite graph methods.

Large graph methods attack the problem head-on while keeping the full graph. Within the graph cut tradition, the survey distinguishes approximate and non-approximate approaches. Approximate methods, such as the Nyström technique, KASP and power iteration clustering, speed up the spectral embedding step by working on sampled columns of the similarity matrix or by iteratively estimating eigenvectors. These methods inherit a weakness: because they relax the discrete clustering problem and then post-process the continuous solution, the final result can drift far from the true optimum of the original cut objective, and the post-processing itself is not unique. Non-approximate methods take a different route, solving the graph cut model directly and thereby avoiding the eigenvalue decomposition altogether. Algorithms such as Fast-CD, which uses coordinate descent to update the cluster indicator matrix without any auxiliary variables, reduce the time complexity from n cubed to the number of edges, or n squared in the worst dense case. Related models like SBMC and EBMC add balanced regularization terms that prevent the trivial solution of isolating a few objects as a cluster, and they run in linear time.

The second major family, graph density methods, sidesteps the need to specify the number of clusters in advance, a decisive advantage when that number is unknown. Density-based spatial clustering of applications with noise, or DBSCAN, and density peaks clustering, or DPC, both identify clusters by separating high-density regions from low-density valleys in the data space. Their Achilles heel is a time complexity of n squared and a proliferation of parameters that weakens generalization. The survey documents a wave of accelerations built on k-nearest-neighbor searches, sampling strategies and grid-based indexing. Methods such as KNN-DBSCAN restrict density calculations to each point’s top-k neighbors, achieving linear computational and storage costs, while FastDPeak, DenPEHC and ADPC-KNN accelerate the density peak search or combine it with k-means to improve scalability. Distributed implementations on MapReduce-style frameworks extend these ideas to truly massive datasets.

Bipartite graph methods represent the survey’s most conceptually elegant acceleration strategy. Rather than wrestling with the full n-by-n graph, these methods select a small set of m representative anchor points and construct a compact n-by-m bipartite graph that records each sample’s affinity to each anchor. The full graph can then be approximated as a product involving the bipartite graph, and crucially, spectral analysis can be performed on a small m-by-m matrix instead of the original one, cutting the complexity from n cubed to n times m squared. The survey carefully dissects how anchors are generated, comparing random selection, k-means strategies, balanced k-means based hierarchical k-means (BKHK), variance-based de-correlation anchor selection (VDA), anchor learning with graph (ALG) and directly alternate sampling (DAS). BKHK stands out for producing stable, representative anchors efficiently, while VDA and ALG avoid random initialization entirely and better capture the intrinsic structure of the data. When the input is already a graph, such as a social network or citation network, label propagation algorithms can learn the compact bipartite representation directly from the edge structure.

On top of this bipartite scaffolding, the survey identifies three distinct clustering strategies. Graph cut methods such as FSC, LSC and FNC either apply singular value decomposition to the small anchor matrix or optimize the bipartite cut model directly, with algorithms like FDBC and GCSED pushing complexity down to linear time. Co-clustering methods exploit the duality between samples and features, grouping rows and columns of a data matrix simultaneously, which is particularly valuable for text and gene expression data; approaches range from Dhillon’s bipartite spectral graph partitioning to non-negative matrix tri-factorization and information-theoretic schemes. Label transmission methods go one step further: instead of updating an n-by-c label matrix through every iteration, they transmit label information from the m anchors to all samples through the relation Y = BU, so that only an m-by-c matrix needs updating. The FCAG algorithm achieves this while avoiding trivial solutions without extra parameters, and its iteration cost is entirely independent of the number of samples.

The multi-view setting, where the same entities are described by several heterogeneous feature sets or graphs, multiplies the computational burden, and the survey shows how the same two families of accelerations carry over. Early fusion methods first merge all views into a single weighted fusion graph and then cluster it; late fusion methods cluster each view separately and align the resulting embeddings. In both cases, the eigenvalue decomposition of Laplacian matrices remains the bottleneck, so fast multi-view algorithms either bypass it entirely or adopt anchors. Algorithms such as OMSC, FMVPG and FMDC obtain discrete cluster indicators directly through non-negative embeddings, spectral rotation or two-step optimization, avoiding EVD and reaching linear complexity. Anchor-based multi-view methods, including SFMC, BIGMC, FMCNOF and EMKMC, construct per-view bipartite graphs, often sharing a common anchor set selected by k-means on the union of views, and fuse them as weighted sums. Tensor-based approaches like TBGL and SWAGL add low-rank tensor regularization to capture complementary structure across views, at a steep price in running time.

The survey is not purely theoretical. The authors benchmark dozens of representative algorithms on standard single-view datasets, including face image collections such as AR, Face and Umist, the emotion recognition set CK, the speech dataset Isolet and the gesture dataset Palm, and on multi-view benchmarks including MSRC, ORL, YaleB, Wikipedia articles, Caltech101, Scene, Digit and MNIST, measuring accuracy and normalized mutual information over twenty repeated runs. Their findings are refreshingly candid: no single algorithm dominates across all data, so matching the method to the dataset remains essential. In running time, FCAG, Fast-CD and KASP emerge as the three fastest single-view methods, each for a different reason: KASP performs eigenvalue decomposition on small sampled matrices, Fast-CD solves the cut model directly without EVD, and FCAG updates only small label matrices through anchor guidance. In the multi-view experiments, MVFCAG excels on scene images, TBGL and SFMC lead on text and handwritten digits, and non-negative matrix factorization methods suit face images, while TBGL’s tensor machinery makes it the slowest of the bunch.

The survey closes with a sober look at what remains unsolved. Many fast algorithms trade accuracy for speed and can falter on noisy or incomplete data; robustness to outliers is still an open challenge. Parameter sensitivity, whether in the number of anchors, the sparsity of the graph or density thresholds, often demands domain expertise, motivating the search for parameter-free formulations. Dynamic graphs that evolve over time, and semi-supervised settings where scarce labels could guide clustering, both represent fertile ground for future work. Yet the trajectory is clear: fast graph clustering now delivers real-time or near real-time results on large-scale data with modest memory footprints, making it deployable on embedded systems and edge platforms and compatible with parallel and GPU computing. From disrupting criminal networks in social media to analyzing surveillance video and intelligence documents, the methods catalogued in this survey are quietly reshaping what is computationally possible in unsupervised learning.

Subject of Research: Fast graph clustering algorithms for large-scale single-view and multi-view data

Article Title: A comprehensive survey of fast graph clustering

Article References: Xue, J., Xing, L., Wang, Y., Fan, X., Kong, L., Zhang, Q., Nie, F., & Li, X. (2024). A comprehensive survey of fast graph clustering. Vicinagearth, 1(1), Article 7. https://doi.org/10.1007/s44336-024-00008-3

Image Credits: AI Generated

DOI: 10.1007/s44336-024-00008-3

Keywords: graph clustering, spectral clustering, bipartite graph, anchor points, graph cut, density peaks clustering, multi-view clustering, eigenvalue decomposition, non-negative matrix factorization, label propagation, scalable machine learning, unsupervised learning