{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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,"slug":"data-driven-soil-organic-carbon-sampling","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,"slug":"accelerating-spectral-clustering-under","title":"Accelerating Spectral Clustering under Fairness Constraints","date":"2025-06-09","arxiv_id":"2506.08143","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-per-tree-canopy-volume-estimation","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,"slug":"strongly-consistent-community-detection-in","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,"slug":"identifying-alzheimer-s-disease-prediction","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,"slug":"near-optimal-clustering-in-mixture-of-markov","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,"slug":"enhancing-drug-discovery-autoencoder-based","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,"slug":"spectral-clustering-for-dependent-community","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,"slug":"on-the-geometry-of-semantics-in-next-token","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,"slug":"on-the-price-of-differential-privacy-for-1","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,"slug":"a-method-for-handling-negative-similarities","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,"slug":"unsupervised-learning-comparative-analysis-of","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,"slug":"using-machine-learning-for-lunar-mineralogy-i","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,"slug":"how-feasible-is-augmenting-fake-nodes-with","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","slug":"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","slug":"coreset-spectral-clustering","title":"Coreset Spectral Clustering","date":"2025-03-10","arxiv_id":"2503.07227","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-view-spectral-clustering-on-the","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,"slug":"generative-kernel-spectral-clustering","title":"Generative Kernel Spectral Clustering","date":"2025-02-04","arxiv_id":"2502.02185","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimax-optimal-covariance-projected-spectral","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,"slug":"silvr-scalable-lidar-visual-radiance-field","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,"slug":"comparative-analysis-of-community-detection","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,"slug":"a-spectral-clustering-type-algorithm-for-the","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,"slug":"a-comprehensive-survey-on-spectral-clustering","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,"slug":"consistent-spectral-clustering-in-sparse","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","slug":"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,"slug":"pay-attention-to-the-foreground-in-object","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,"slug":"on-the-robustness-of-spectral-algorithms-for","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","slug":"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,"slug":"unsupervised-segmentation-by-diffusing","title":"Unsupervised Segmentation by Diffusing, Walking and Cutting","date":"2024-12-06","arxiv_id":"2412.04678","n_code_links":0,"syntology":null},{"paper":null,"slug":"construction-of-generalized-samplets-in","title":"Construction of generalized samplets in Banach spaces","date":"2024-12-01","arxiv_id":"2412.00954","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-self-supervised-heterogeneous","slug":"revisiting-self-supervised-heterogeneous","title":"Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective","date":"2024-12-01","arxiv_id":"2412.00742","n_code_links":1,"syntology":null},{"paper":"/paper/a-novel-word-pair-based-gaussian-sentence","slug":"a-novel-word-pair-based-gaussian-sentence","title":"A Novel Word Pair-based Gaussian Sentence Similarity Algorithm For Bengali Extractive Text Summarization","date":"2024-11-26","arxiv_id":"2411.17181","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-layer-matrix-factorization-for-cancer","title":"Multi-layer matrix factorization for cancer subtyping using full and partial multi-omics dataset","date":"2024-11-18","arxiv_id":"2411.15180","n_code_links":0,"syntology":null},{"paper":null,"slug":"multiscale-graph-construction-using-non-local","title":"Multiscale Graph Construction Using Non-local Cluster Features","date":"2024-11-13","arxiv_id":"2411.08371","n_code_links":0,"syntology":null},{"paper":"/paper/centrality-graph-shift-operators-for-graph","slug":"centrality-graph-shift-operators-for-graph","title":"Centrality Graph Shift Operators for Graph Neural Networks","date":"2024-11-07","arxiv_id":"2411.04655","n_code_links":1,"syntology":null},{"paper":null,"slug":"community-detection-with-the-bethe-hessian","title":"Community detection with the Bethe-Hessian","date":"2024-11-05","arxiv_id":"2411.02835","n_code_links":0,"syntology":null},{"paper":null,"slug":"clustering-based-on-density-propagation-and","title":"Clustering Based on Density Propagation and Subcluster Merging","date":"2024-11-04","arxiv_id":"2411.01780","n_code_links":0,"syntology":null},{"paper":null,"slug":"temporal-patterns-of-multiple-long-term","title":"Temporal Patterns of Multiple Long-Term Conditions in Individuals with Intellectual Disability Living in Wales: An Unsupervised Clustering Approach to Disease Trajectories","date":"2024-10-28","arxiv_id":"2411.08894","n_code_links":0,"syntology":null},{"paper":null,"slug":"hypergraphs-as-weighted-directed-self-looped","title":"Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality","date":"2024-10-23","arxiv_id":"2411.03331","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-satellite-non-iid-imagery-a-spectral","title":"Towards Satellite Non-IID Imagery: A Spectral Clustering-Assisted Federated Learning Approach","date":"2024-10-17","arxiv_id":"2410.13602","n_code_links":0,"syntology":null},{"paper":null,"slug":"shypar-a-spectral-coarsening-approach-to","title":"SHyPar: A Spectral Coarsening Approach to Hypergraph Partitioning","date":"2024-10-09","arxiv_id":"2410.10875","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-domain-isolation-and-sample-clustered","title":"Deep Domain Isolation and Sample Clustered Federated Learning for Semantic Segmentation","date":"2024-10-04","arxiv_id":"2410.14693","n_code_links":0,"syntology":null},{"paper":"/paper/deep-signature-characterization-of-large","slug":"deep-signature-characterization-of-large","title":"Deep Signature: Characterization of Large-Scale Molecular Dynamics","date":"2024-10-03","arxiv_id":"2410.02847","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":3,"n_instrument":2,"unverified":3,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["wonderseven/deep-signature"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["community","official"]}}},{"paper":"/paper/self-tuning-spectral-clustering-for-speaker","slug":"self-tuning-spectral-clustering-for-speaker","title":"Self-Tuning Spectral Clustering for Speaker Diarization","date":"2024-09-16","arxiv_id":"2410.00023","n_code_links":1,"syntology":null},{"paper":null,"slug":"tcg-crest-system-description-for-the-second","title":"TCG CREST System Description for the Second DISPLACE Challenge","date":"2024-09-16","arxiv_id":"2409.15356","n_code_links":0,"syntology":null},{"paper":null,"slug":"consistent-spectral-clustering-in-hyperbolic","title":"Consistent Spectral Clustering in Hyperbolic Spaces","date":"2024-09-14","arxiv_id":"2409.09304","n_code_links":0,"syntology":null},{"paper":null,"slug":"continual-learning-in-3d-point-clouds","title":"Continual Learning in 3D Point Clouds: Employing Spectral Techniques for Exemplar Selection","date":"2024-09-12","arxiv_id":"2409.08388","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-sparse-representation-clustering","slug":"hierarchical-sparse-representation-clustering","title":"Hierarchical Sparse Representation Clustering for High-Dimensional Data Streams","date":"2024-09-07","arxiv_id":"2409.04698","n_code_links":1,"syntology":null},{"paper":null,"slug":"factor-adjusted-spectral-clustering-for","title":"Factor Adjusted Spectral Clustering for Mixture Models","date":"2024-08-22","arxiv_id":"2408.12564","n_code_links":0,"syntology":null},{"paper":null,"slug":"rank-and-align-towards-effective-source-free","title":"Rank and Align: Towards Effective Source-free Graph Domain Adaptation","date":"2024-08-22","arxiv_id":"2408.12185","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-spectral-clustering-with-rank","title":"Robust spectral clustering with rank statistics","date":"2024-08-19","arxiv_id":"2408.10136","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-and-adaptive-spectral-embedding-for","title":"Scalable and Adaptive Spectral Embedding for Attributed Graph Clustering","date":"2024-08-11","arxiv_id":"2408.05765","n_code_links":0,"syntology":null},{"paper":"/paper/2408-02043","slug":"2408-02043","title":"Deep Spectral Methods for Unsupervised Ultrasound Image Interpretation","date":"2024-08-04","arxiv_id":"2408.02043","n_code_links":1,"syntology":null},{"paper":null,"slug":"sangria-surgical-video-scene-graph","title":"SANGRIA: Surgical Video Scene Graph Optimization for Surgical Workflow Prediction","date":"2024-07-29","arxiv_id":"2407.20214","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-clustering-based-view-planning-method","title":"A New Clustering-based View Planning Method for Building Inspection with Drone","date":"2024-07-19","arxiv_id":"2408.01435","n_code_links":0,"syntology":null},{"paper":"/paper/advanced-graph-clustering-methods-a","slug":"advanced-graph-clustering-methods-a","title":"Advanced Graph Clustering Methods: A Comprehensive and In-Depth Analysis","date":"2024-07-12","arxiv_id":"2407.09055","n_code_links":1,"syntology":null},{"paper":null,"slug":"clustering-time-evolving-networks-using-the","title":"Clustering Time-Evolving Networks Using the Spatio-Temporal Graph Laplacian","date":"2024-07-12","arxiv_id":"2407.12864","n_code_links":0,"syntology":null},{"paper":null,"slug":"spinex-clustering-similarity-based","title":"SPINEX-Clustering: Similarity-based Predictions with Explainable Neighbors Exploration for Clustering Problems","date":"2024-07-09","arxiv_id":"2407.07222","n_code_links":0,"syntology":null},{"paper":null,"slug":"academic-article-recommendation-using","title":"Academic Article Recommendation Using Multiple Perspectives","date":"2024-07-08","arxiv_id":"2407.05836","n_code_links":0,"syntology":null},{"paper":null,"slug":"sot-triggered-neural-clustering-for-speaker","title":"SOT Triggered Neural Clustering for Speaker Attributed ASR","date":"2024-07-02","arxiv_id":"2407.02007","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinterpreting-economic-complexity-a-co","title":"Reinterpreting Economic Complexity: A co-clustering approach","date":"2024-06-23","arxiv_id":"2406.16199","n_code_links":0,"syntology":null},{"paper":null,"slug":"system-description-for-the-displace-speaker","title":"System Description for the Displace Speaker Diarization Challenge 2023","date":"2024-06-20","arxiv_id":"2406.15516","n_code_links":0,"syntology":null},{"paper":null,"slug":"cluster-quilting-spectral-clustering-for","title":"Cluster Quilting: Spectral Clustering for Patchwork Learning","date":"2024-06-19","arxiv_id":"2406.13833","n_code_links":0,"syntology":null},{"paper":null,"slug":"selecting-the-number-of-communities-for","title":"Selecting the Number of Communities for Weighted Degree-Corrected Stochastic Block Models","date":"2024-06-08","arxiv_id":"2406.05340","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-spectral-clustering-with-provable","slug":"dynamic-spectral-clustering-with-provable","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","date":"2024-06-05","arxiv_id":"2406.03152","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":1,"n_instrument":3,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"clustering-mixtures-of-discrete-distributions","title":"Clustering Mixtures of Discrete Distributions: A Note on Mitra's Algorithm","date":"2024-05-29","arxiv_id":"2405.19559","n_code_links":0,"syntology":null},{"paper":null,"slug":"image-to-pseudo-episode-boosting-few-shot","title":"Image to Pseudo-Episode: Boosting Few-Shot Segmentation by Unlabeled Data","date":"2024-05-14","arxiv_id":"2405.08765","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-clustering-in-convex-and-constrained","title":"Spectral Clustering in Convex and Constrained Settings","date":"2024-04-03","arxiv_id":"2404.03012","n_code_links":0,"syntology":null},{"paper":"/paper/maximum-likelihood-estimation-on-stochastic","slug":"maximum-likelihood-estimation-on-stochastic","title":"Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models","date":"2024-03-28","arxiv_id":"2403.19516","n_code_links":1,"syntology":null},{"paper":null,"slug":"assessing-the-robustness-of-spectral","title":"Assessing the Robustness of Spectral Clustering for Deep Speaker Diarization","date":"2024-03-21","arxiv_id":"2403.14286","n_code_links":0,"syntology":null},{"paper":null,"slug":"community-detection-by-spectral-methods-in","title":"Community detection by spectral methods in multi-layer networks","date":"2024-03-19","arxiv_id":"2403.12540","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-clustering-of-categorical-and-mixed","title":"Spectral Clustering of Categorical and Mixed-type Data via Extra Graph Nodes","date":"2024-03-08","arxiv_id":"2403.05669","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-model-selection-technique-for","title":"A Unified Model Selection Technique for Spectral Clustering Based Motion Segmentation","date":"2024-03-03","arxiv_id":"2403.01606","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-multi-relational-graph","slug":"hierarchical-multi-relational-graph","title":"Hierarchical Multi-Relational Graph Representation Learning for Large-Scale Prediction of Drug-Drug Interactions","date":"2024-02-28","arxiv_id":"2402.18127","n_code_links":1,"syntology":null},{"paper":null,"slug":"estimating-stochastic-block-models-in-the","title":"Estimating Stochastic Block Models in the Presence of Covariates","date":"2024-02-26","arxiv_id":"2402.16322","n_code_links":0,"syntology":null},{"paper":null,"slug":"asymptotic-gaussian-fluctuations-of","title":"Asymptotic Gaussian Fluctuations of Eigenvectors in Spectral Clustering","date":"2024-02-19","arxiv_id":"2402.12302","n_code_links":0,"syntology":null},{"paper":null,"slug":"listening-to-multi-talker-conversations","title":"Listening to Multi-talker Conversations: Modular and End-to-end Perspectives","date":"2024-02-14","arxiv_id":"2402.08932","n_code_links":0,"syntology":null},{"paper":"/paper/graph-cuts-with-arbitrary-size-constraints","slug":"graph-cuts-with-arbitrary-size-constraints","title":"Graph Cuts with Arbitrary Size Constraints Through Optimal Transport","date":"2024-02-07","arxiv_id":"2402.04732","n_code_links":1,"syntology":null},{"paper":"/paper/multilayer-graph-approach-to-deep-subspace","slug":"multilayer-graph-approach-to-deep-subspace","title":"Multilayer Graph Approach to Deep Subspace Clustering","date":"2024-01-30","arxiv_id":"2401.17033","n_code_links":1,"syntology":null},{"paper":null,"slug":"spectral-clustering-for-discrete","title":"Spectral Clustering for Discrete Distributions","date":"2024-01-25","arxiv_id":"2401.13913","n_code_links":0,"syntology":null},{"paper":null,"slug":"geodesic-interpolation-of-frame-wise-speaker","title":"Geodesic interpolation of frame-wise speaker embeddings for the diarization of meeting scenarios","date":"2024-01-08","arxiv_id":"2401.03963","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-sampled-clustering-algorithm-for-rice","title":"A Novel Sampled Clustering Algorithm for Rice Phenotypic Data","date":"2023-12-22","arxiv_id":"2312.14920","n_code_links":0,"syntology":null},{"paper":"/paper/meancut-a-greedy-optimized-graph-clustering","slug":"meancut-a-greedy-optimized-graph-clustering","title":"MeanCut: A Greedy-Optimized Graph Clustering via Path-based Similarity and Degree Descent Criterion","date":"2023-12-07","arxiv_id":"2312.04067","n_code_links":2,"syntology":null},{"paper":null,"slug":"clustering-inductive-biases-with-unrolled","title":"Clustering Inductive Biases with Unrolled Networks","date":"2023-11-30","arxiv_id":"2402.10213","n_code_links":0,"syntology":null},{"paper":null,"slug":"disentangling-the-spectral-properties-of-the","title":"Disentangling the Spectral Properties of the Hodge Laplacian: Not All Small Eigenvalues Are Equal","date":"2023-11-24","arxiv_id":"2311.14427","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-framework-for-fair-spectral","title":"A Unified Framework for Fair Spectral Clustering With Effective Graph Learning","date":"2023-11-23","arxiv_id":"2311.13766","n_code_links":0,"syntology":null},{"paper":null,"slug":"dscom-a-data-driven-self-adaptive-community","title":"DSCom: A Data-Driven Self-Adaptive Community-Based Framework for Influence Maximization in Social Networks","date":"2023-11-18","arxiv_id":"2311.11080","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-poincare-inequality-and-consistency-results","title":"A Poincaré Inequality and Consistency Results for Signal Sampling on Large Graphs","date":"2023-11-17","arxiv_id":"2311.10610","n_code_links":0,"syntology":null},{"paper":"/paper/toward-efficient-and-incremental-spectral","slug":"toward-efficient-and-incremental-spectral","title":"Toward Efficient and Incremental Spectral Clustering via Parametric Spectral Clustering","date":"2023-11-14","arxiv_id":"2311.07833","n_code_links":1,"syntology":null},{"paper":"/paper/boosting-spectral-clustering-on-incomplete","slug":"boosting-spectral-clustering-on-incomplete","title":"Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity Learning","date":"2023-11-03","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-sublinear-time-spectral-clustering-oracle","title":"A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time","date":"2023-10-27","arxiv_id":"2310.17878","n_code_links":0,"syntology":null},{"paper":null,"slug":"community-detection-and-classification","title":"Community Detection Guarantees Using Embeddings Learned by Node2Vec","date":"2023-10-26","arxiv_id":"2310.17712","n_code_links":0,"syntology":null},{"paper":"/paper/accelerated-sparse-kernel-spectral-clustering","slug":"accelerated-sparse-kernel-spectral-clustering","title":"Accelerated sparse Kernel Spectral Clustering for large scale data clustering problems","date":"2023-10-20","arxiv_id":"2310.13381","n_code_links":1,"syntology":null},{"paper":null,"slug":"brfl-a-blockchain-based-byzantine-robust","title":"BRFL: A Blockchain-based Byzantine-Robust Federated Learning Model","date":"2023-10-20","arxiv_id":"2310.13403","n_code_links":0,"syntology":null},{"paper":null,"slug":"random-matrix-analysis-to-balance-between","title":"Random Matrix Analysis to Balance between Supervised and Unsupervised Learning under the Low Density Separation Assumption","date":"2023-10-20","arxiv_id":"2310.13434","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-decadal-sea-level-prediction-using","title":"Multi-decadal Sea Level Prediction using Neural Networks and Spectral Clustering on Climate Model Large Ensembles and Satellite Altimeter Data","date":"2023-10-06","arxiv_id":"2310.04540","n_code_links":0,"syntology":null},{"paper":null,"slug":"motion-segmentation-from-a-moving-monocular","title":"Motion Segmentation from a Moving Monocular Camera","date":"2023-09-24","arxiv_id":"2309.13772","n_code_links":0,"syntology":null},{"paper":"/paper/fast-and-simple-spectral-clustering-in-theory","slug":"fast-and-simple-spectral-clustering-in-theory","title":"Fast and Simple Spectral Clustering in Theory and Practice","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"federated-spectral-clustering-via-secure","title":"Federated Spectral Clustering via Secure Similarity Reconstruction","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/early-diagnosis-of-autism-spectrum-disorder","slug":"early-diagnosis-of-autism-spectrum-disorder","title":"An Evaluation of Machine Learning Approaches for Early Diagnosis of Autism Spectrum Disorder","date":"2023-09-20","arxiv_id":"2309.11646","n_code_links":1,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":517,"with_a_code_link":136,"where_syntology_ran_a_sample":20,"not_listed_spam_title":0,"listed":517,"listed_where_code_ran":20,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":16,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":16,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":20,"papers_where_code_ran_first_page":"/method/spectral-clustering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":6,"url":"/method/spectral-clustering/papers/2","json":"/method/spectral-clustering/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/method/spectral-clustering/papers/3","json":"/method/spectral-clustering/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/method/spectral-clustering/papers/4","json":"/method/spectral-clustering/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/method/spectral-clustering/papers/5","json":"/method/spectral-clustering/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/method/spectral-clustering/papers/6","json":"/method/spectral-clustering/papers/6.json","rows":17},{"order":"ran","page":1,"of":1,"url":"/method/spectral-clustering/papers/ran/1","json":"/method/spectral-clustering/papers/ran/1.json","rows":20}],"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-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Spectral%20Clustering","read_at":"2026-10-05T01:02:24+00:00","query":"Spectral Clustering","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"0711.0189","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Spectral Clustering' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Multi-kernel spectral clustering","Higher-Order Spectral Clustering","constrained spectral biclustering","automated spectral clustering method","simple spectral clustering algorithm","Fully Dynamic Coreset Spectral Clustering","Neural Tangent Kernel Spectral Clustering","Riemannian Fair Spectral Clustering (R-FairSC)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a3f622291deecb7d321ad5800412ce38faef9696647342cfffc792512ca65648","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}