{"url":"/method/spectral-clustering","slug":"spectral-clustering","name":"Spectral Clustering","full_name":"Spectral Clustering","full_name_withheld":false,"description_markdown":"Spectral clustering has attracted increasing attention due to\r\nthe promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the spectrum of the graph Laplacian is used to reveal the cluster structure. The spectral clustering algorithm mainly consists of two steps: 1) constructs the low dimensional embedded representation of the data based on the eigenvectors of the graph Laplacian, 2) applies k-means on the constructed low dimensional data to obtain the clustering result. Thus,","description_state":"present","introduced_year":null,"introduced_by":{"title":"A Tutorial on Spectral Clustering","paper":"/paper/a-tutorial-on-spectral-clustering","first_author":"Ulrike von Luxburg","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/a-tutorial-on-spectral-clustering"},"source":{"url":"http://arxiv.org/abs/0711.0189v1","title":"A Tutorial on Spectral Clustering","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Clustering","url":"/methods/category/clustering","pwc_aliases":[]}],"n_papers_tagged":517,"archive_num_papers":518,"papers_newest_first":[{"paper":null,"title":"Data-Driven Soil Organic Carbon Sampling: Integrating Spectral Clustering with Conditioned Latin Hypercube Optimization","date":"2025-06-12","arxiv_id":"2506.10419","n_code_links":0,"syntology":null},{"paper":null,"title":"Accelerating Spectral Clustering under Fairness Constraints","date":"2025-06-09","arxiv_id":"2506.08143","n_code_links":0,"syntology":null},{"paper":null,"title":"Adaptive Per-Tree Canopy Volume Estimation Using Mobile LiDAR in Structured and Unstructured Orchards","date":"2025-06-09","arxiv_id":"2506.08061","n_code_links":0,"syntology":null},{"paper":null,"title":"Strongly Consistent Community Detection in Popularity Adjusted Block Models","date":"2025-06-08","arxiv_id":"2506.07224","n_code_links":0,"syntology":null},{"paper":null,"title":"Identifying Alzheimer's Disease Prediction Strategies of Convolutional Neural Network Classifiers using R2* Maps and Spectral Clustering","date":"2025-06-04","arxiv_id":"2506.03890","n_code_links":0,"syntology":null},{"paper":null,"title":"Near-Optimal Clustering in Mixture of Markov Chains","date":"2025-06-02","arxiv_id":"2506.01324","n_code_links":0,"syntology":null},{"paper":null,"title":"Enhancing Drug Discovery: Autoencoder-Based Latent Space Augmentation for Improved Molecular Solubility Prediction using LatMixSol","date":"2025-05-30","arxiv_id":"2506.00223","n_code_links":0,"syntology":null},{"paper":null,"title":"Spectral clustering for dependent community Hawkes process models of temporal networks","date":"2025-05-28","arxiv_id":"2505.21845","n_code_links":0,"syntology":null},{"paper":null,"title":"On the Geometry of Semantics in Next-token Prediction","date":"2025-05-13","arxiv_id":"2505.08348","n_code_links":0,"syntology":null},{"paper":null,"title":"On the Price of Differential Privacy for Spectral Clustering over Stochastic Block Models","date":"2025-05-09","arxiv_id":"2505.05816","n_code_links":0,"syntology":null},{"paper":null,"title":"A Method for Handling Negative Similarities in Explainable Graph Spectral Clustering of Text Documents -- Extended Version","date":"2025-04-16","arxiv_id":"2504.12360","n_code_links":0,"syntology":null},{"paper":null,"title":"Unsupervised Learning: Comparative Analysis of Clustering Techniques on High-Dimensional Data","date":"2025-03-29","arxiv_id":"2503.23215","n_code_links":0,"syntology":null},{"paper":null,"title":"Using Machine Learning for Lunar Mineralogy-I: Hyperspectral Imaging of Volcanic Samples","date":"2025-03-28","arxiv_id":"2503.22617","n_code_links":0,"syntology":null},{"paper":null,"title":"How Feasible is Augmenting Fake Nodes with Learnable Features as a Counter-strategy against Link Stealing Attacks?","date":"2025-03-12","arxiv_id":"2503.09726","n_code_links":0,"syntology":null},{"paper":"/paper/neural-normalized-cut-a-differential-and","title":"Neural Normalized Cut: A Differential and Generalizable Approach for Spectral Clustering","date":"2025-03-12","arxiv_id":"2503.09260","n_code_links":1,"syntology":null},{"paper":"/paper/coreset-spectral-clustering","title":"Coreset Spectral Clustering","date":"2025-03-10","arxiv_id":"2503.07227","n_code_links":1,"syntology":null},{"paper":null,"title":"Multi-view Spectral Clustering on the Grassmannian Manifold With Hypergraph Representation","date":"2025-03-08","arxiv_id":"2503.06066","n_code_links":0,"syntology":null},{"paper":null,"title":"Generative Kernel Spectral Clustering","date":"2025-02-04","arxiv_id":"2502.02185","n_code_links":0,"syntology":null},{"paper":null,"title":"Minimax-Optimal Dimension-Reduced Clustering for High-Dimensional Nonspherical Mixtures","date":"2025-02-04","arxiv_id":"2502.02580","n_code_links":0,"syntology":null},{"paper":null,"title":"SiLVR: Scalable Lidar-Visual Radiance Field Reconstruction with Uncertainty Quantification","date":"2025-02-04","arxiv_id":"2502.02657","n_code_links":0,"syntology":null},{"paper":null,"title":"Comparative Analysis of Community Detection Algorithms on the SNAP Social Circles Dataset","date":"2025-02-01","arxiv_id":"2502.04341","n_code_links":0,"syntology":null},{"paper":null,"title":"A spectral clustering-type algorithm for the consistent estimation of the Hurst distribution in moderately high dimensions","date":"2025-01-30","arxiv_id":"2501.18115","n_code_links":0,"syntology":null},{"paper":null,"title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","date":"2025-01-23","arxiv_id":"2501.13597","n_code_links":0,"syntology":null},{"paper":null,"title":"Consistent spectral clustering in sparse tensor block models","date":"2025-01-23","arxiv_id":"2501.13820","n_code_links":0,"syntology":null},{"paper":"/paper/multi-view-spectral-clustering-for-graphs","title":"Multi-View Spectral Clustering for Graphs with Multiple View Structures","date":"2025-01-20","arxiv_id":"2501.11422","n_code_links":1,"syntology":null},{"paper":null,"title":"Pay Attention to the Foreground in Object-Centric Learning","date":"2025-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"title":"On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models","date":"2024-12-18","arxiv_id":"2412.14315","n_code_links":0,"syntology":null},{"paper":"/paper/pasco-parallel-structured-coarsening-an","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","date":"2024-12-18","arxiv_id":"2412.13592","n_code_links":1,"syntology":null},{"paper":null,"title":"Unsupervised Segmentation by Diffusing, Walking and Cutting","date":"2024-12-06","arxiv_id":"2412.04678","n_code_links":0,"syntology":null},{"paper":null,"title":"Construction of generalized samplets in Banach spaces","date":"2024-12-01","arxiv_id":"2412.00954","n_code_links":0,"syntology":null}],"papers_shown":30,"tasks":[{"task":"/task/clustering","name":"Clustering","papers":465},{"task":"/task/community-detection","name":"Community Detection","papers":48},{"task":"/task/stochastic-block-model","name":"Stochastic Block Model","papers":48},{"task":"/task/graph-clustering","name":"Graph Clustering","papers":33},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":27},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":21},{"task":"/task/segmentation","name":"Segmentation","papers":20},{"task":"/task/graph-partitioning","name":"graph partitioning","papers":19},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":15},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":15},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":12},{"task":"/task/object","name":"Object","papers":11},{"task":"/task/speaker-diarization","name":"Speaker Diarization","papers":11},{"task":"/task/spectral-graph-clustering","name":"Spectral Graph Clustering","papers":11},{"task":"/task/speaker-diarization","name":"speaker-diarization","papers":11},{"task":"/task/image-clustering","name":"Image Clustering","papers":10},{"task":"/task/motion-segmentation","name":"Motion Segmentation","papers":10},{"task":"/task/representation-learning","name":"Representation Learning","papers":10},{"task":"/task/deep-clustering","name":"Deep Clustering","papers":9},{"task":"/task/classification","name":"General Classification","papers":9}],"tasks_shown":20,"n_tasks":244,"usage_by_year":[{"year":"2007","papers":1},{"year":"2008","papers":2},{"year":"2011","papers":4},{"year":"2012","papers":5},{"year":"2013","papers":11},{"year":"2014","papers":21},{"year":"2015","papers":26},{"year":"2016","papers":20},{"year":"2017","papers":33},{"year":"2018","papers":34},{"year":"2019","papers":72},{"year":"2020","papers":65},{"year":"2021","papers":43},{"year":"2022","papers":48},{"year":"2023","papers":51},{"year":"2024","papers":55},{"year":"2025","papers":26}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/spectral-clustering"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}