{"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/papers/3","list_of":"/method/spectral-clustering","method":"Spectral Clustering","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":3,"pages_in_order":6,"rows_per_page":100,"rows":[201,300],"of":517,"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":17,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"first_page":"/method/spectral-clustering","prev":"/method/spectral-clustering/papers/2","next":"/method/spectral-clustering/papers/4","papers":[{"paper":null,"slug":"laplacian-based-dimensionality-reduction","title":"Laplacian-Based Dimensionality Reduction Including Spectral Clustering, Laplacian Eigenmap, Locality Preserving Projection, Graph Embedding, and Diffusion Map: Tutorial and Survey","date":"2021-06-03","arxiv_id":"2106.02154","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comprehensive-survey-on-community-detection","title":"A Comprehensive Survey on Community Detection with Deep Learning","date":"2021-05-26","arxiv_id":"2105.12584","n_code_links":0,"syntology":null},{"paper":null,"slug":"exact-recovery-in-the-general-hypergraph","title":"Exact Recovery in the General Hypergraph Stochastic Block Model","date":"2021-05-11","arxiv_id":"2105.04770","n_code_links":0,"syntology":null},{"paper":null,"slug":"protecting-individual-interests-across","title":"Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted Partitions","date":"2021-05-08","arxiv_id":"2105.03714","n_code_links":0,"syntology":null},{"paper":"/paper/divide-and-conquer-based-large-scale-spectral-1","slug":"divide-and-conquer-based-large-scale-spectral-1","title":"Divide-and-conquer based Large-Scale Spectral Clustering","date":"2021-04-30","arxiv_id":"2104.15042","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-class-of-network-models-recoverable-by-1","title":"A class of network models recoverable by spectral clustering","date":"2021-04-21","arxiv_id":"2104.10347","n_code_links":0,"syntology":null},{"paper":"/paper/deep-clustering-with-measure-propagation","slug":"deep-clustering-with-measure-propagation","title":"Deep Clustering with Measure Propagation","date":"2021-04-18","arxiv_id":"2104.08967","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-fast-and-accurate-similarity-constrained","title":"A fast and Accurate Similarity-constrained Subspace Clustering Framework for Unsupervised Hyperspectral Image Classification","date":"2021-04-14","arxiv_id":"2104.06975","n_code_links":0,"syntology":null},{"paper":"/paper/learning-spatial-context-with-graph-neural","slug":"learning-spatial-context-with-graph-neural","title":"Learning Spatial Context with Graph Neural Network for Multi-Person Pose Grouping","date":"2021-04-06","arxiv_id":"2104.02385","n_code_links":1,"syntology":null},{"paper":null,"slug":"k-expectiles-clustering","title":"K-expectiles clustering","date":"2021-03-16","arxiv_id":"2103.09329","n_code_links":0,"syntology":null},{"paper":null,"slug":"skillbert-skilling-the-bert-to-classify-1","title":"SKILLBERT: “SKILLING” THE BERT TO CLASSIFY SKILLS!","date":"2021-03-08","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"network-cluster-robust-inference","title":"Network Cluster-Robust Inference","date":"2021-03-02","arxiv_id":"2103.01470","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-mathematics-behind-spectral-clustering","title":"The Mathematics Behind Spectral Clustering And The Equivalence To PCA","date":"2021-03-01","arxiv_id":"2103.00733","n_code_links":0,"syntology":null},{"paper":"/paper/two-way-kernel-matrix-puncturing-towards","slug":"two-way-kernel-matrix-puncturing-towards","title":"Two-way kernel matrix puncturing: towards resource-efficient PCA and spectral clustering","date":"2021-02-24","arxiv_id":"2102.12293","n_code_links":1,"syntology":null},{"paper":"/paper/eigengame-unloaded-when-playing-games-is","slug":"eigengame-unloaded-when-playing-games-is","title":"EigenGame Unloaded: When playing games is better than optimizing","date":"2021-02-08","arxiv_id":"2102.04152","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/refining-a-nearest-neighbor-graph-for-a","slug":"refining-a-nearest-neighbor-graph-for-a","title":"Refining a -nearest neighbor graph for a computationally efficient spectral clustering","date":"2021-02-06","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"clustering-future-scenarios-based-on","title":"Clustering Future Scenarios Based on Predicted Range Maps","date":"2021-01-19","arxiv_id":"2101.07408","n_code_links":0,"syntology":null},{"paper":"/paper/a-framework-for-deep-constrained-clustering","slug":"a-framework-for-deep-constrained-clustering","title":"A Framework for Deep Constrained Clustering","date":"2021-01-07","arxiv_id":"2101.02792","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-interplay-of-demographic-variables-and","title":"The Interplay of Demographic Variables and Social Distancing Scores in Deep Prediction of U.S. COVID-19 Cases","date":"2021-01-06","arxiv_id":"2101.02113","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-learning-via-spectral-densification","title":"Graph Learning via Spectral Densification","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"importance-and-coherence-methods-for","title":"Importance and Coherence: Methods for Evaluating Modularity in Neural Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"skillbert-skilling-the-bert-to-classify","title":"SkillBERT: “Skilling” the BERT to classify skills!","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"subspace-clustering-via-robust-self","title":"Subspace Clustering via Robust Self-Supervised Convolutional Neural Network","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"estimating-mixed-memberships-using-the","title":"Estimating Mixed-Memberships Using the Symmetric Laplacian Inverse Matrix","date":"2020-12-17","arxiv_id":"2012.09561","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-clustering-via-adaptive-layer","title":"Spectral clustering via adaptive layer aggregation for multi-layer networks","date":"2020-12-07","arxiv_id":"2012.04646","n_code_links":0,"syntology":null},{"paper":"/paper/doubly-stochastic-subspace-clustering","slug":"doubly-stochastic-subspace-clustering","title":"Doubly Stochastic Subspace Clustering","date":"2020-11-30","arxiv_id":"2011.14859","n_code_links":1,"syntology":null},{"paper":"/paper/sftrack-a-fast-learnable-spectral","slug":"sftrack-a-fast-learnable-spectral","title":"SFTrack++: A Fast Learnable Spectral Segmentation Approach for Space-Time Consistent Tracking","date":"2020-11-27","arxiv_id":"2011.13843","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["bit-ml/sftrackpp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"estimating-network-memberships-by-mixed","title":"Consistency of regularized spectral clustering in degree-corrected mixed membership model","date":"2020-11-23","arxiv_id":"2011.12239","n_code_links":0,"syntology":null},{"paper":"/paper/scattering-transform-based-image-clustering","slug":"scattering-transform-based-image-clustering","title":"Scattering Transform Based Image Clustering using Projection onto Orthogonal Complement","date":"2020-11-23","arxiv_id":"2011.11586","n_code_links":1,"syntology":null},{"paper":"/paper/ensemble-learning-for-spectral-clustering","slug":"ensemble-learning-for-spectral-clustering","title":"Ensemble Learning for Spectral Clustering","date":"2020-11-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"an-improved-spectral-clustering-method-for","title":"An improved spectral clustering method for community detection under the degree-corrected stochastic blockmodel","date":"2020-11-12","arxiv_id":"2011.06374","n_code_links":0,"syntology":null},{"paper":null,"slug":"dual-regularized-laplacian-spectral","title":"Dual regularized Laplacian spectral clustering methods on community detection","date":"2020-11-09","arxiv_id":"2011.04392","n_code_links":0,"syntology":null},{"paper":"/paper/spectral-clustering-on-spherical-coordinates","slug":"spectral-clustering-on-spherical-coordinates","title":"Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel","date":"2020-11-09","arxiv_id":"2011.04558","n_code_links":1,"syntology":null},{"paper":"/paper/multi-view-subspace-clustering-networks-with","slug":"multi-view-subspace-clustering-networks-with","title":"Multi-view Subspace Clustering Networks with Local and Global Graph Information","date":"2020-10-19","arxiv_id":"2010.09323","n_code_links":1,"syntology":null},{"paper":"/paper/refining-similarity-matrices-to-cluster","slug":"refining-similarity-matrices-to-cluster","title":"Refining Similarity Matrices to Cluster Attributed Networks Accurately","date":"2020-10-14","arxiv_id":"2010.06854","n_code_links":1,"syntology":null},{"paper":null,"slug":"wildfire-smoke-and-air-quality-how-machine","title":"Wildfire Smoke and Air Quality: How Machine Learning Can Guide Forest Management","date":"2020-10-09","arxiv_id":"2010.04651","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-quantized-spectral-clustering-1","title":"Sparse Quantized Spectral Clustering","date":"2020-10-03","arxiv_id":"2010.01376","n_code_links":0,"syntology":null},{"paper":"/paper/semantics-through-time-semi-supervised","slug":"semantics-through-time-semi-supervised","title":"Semantics through Time: Semi-supervised Segmentation of Aerial Videos with Iterative Label Propagation","date":"2020-10-02","arxiv_id":"2010.01910","n_code_links":2,"syntology":null},{"paper":null,"slug":"large-scale-cargo-distribution","title":"Large-Scale Cargo Distribution","date":"2020-09-29","arxiv_id":"2009.14187","n_code_links":0,"syntology":null},{"paper":null,"slug":"higher-order-spectral-clustering-for-1","title":"Higher-Order Spectral Clustering for Geometric Graphs","date":"2020-09-23","arxiv_id":"2009.11353","n_code_links":0,"syntology":null},{"paper":"/paper/overlapping-community-detection-in-networks-1","slug":"overlapping-community-detection-in-networks-1","title":"Overlapping community detection in networks via sparse spectral decomposition","date":"2020-09-20","arxiv_id":"2009.10641","n_code_links":1,"syntology":null},{"paper":null,"slug":"probabilistically-sampled-and-spectrally","title":"Probabilistically Sampled and Spectrally Clustered Plant Genotypes using Phenotypic Characteristics","date":"2020-09-18","arxiv_id":"2009.09028","n_code_links":0,"syntology":null},{"paper":"/paper/characterizing-attitudinal-network-graphs","slug":"characterizing-attitudinal-network-graphs","title":"Characterizing Attitudinal Network Graphs through Frustration Cloud","date":"2020-09-16","arxiv_id":"2009.07776","n_code_links":1,"syntology":null},{"paper":"/paper/approximate-spectral-clustering-using-both","slug":"approximate-spectral-clustering-using-both","title":"Approximate spectral clustering using both reference vectors and topology of the network generated by growing neural gas","date":"2020-09-15","arxiv_id":"2009.07101","n_code_links":1,"syntology":null},{"paper":"/paper/multi-way-spectral-clustering-of-augmented","slug":"multi-way-spectral-clustering-of-augmented","title":"Multi-way Spectral Clustering of Augmented Multi-view Data through Deep Collective Matrix Tri-factorization","date":"2020-09-12","arxiv_id":"2009.05805","n_code_links":1,"syntology":null},{"paper":"/paper/consistency-and-regression-with-laplacian","slug":"consistency-and-regression-with-laplacian","title":"Overcoming the curse of dimensionality with Laplacian regularization in semi-supervised learning","date":"2020-09-09","arxiv_id":"2009.04324","n_code_links":2,"syntology":null},{"paper":null,"slug":"multi-view-spectral-clustering-with-high","title":"Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian Matrix","date":"2020-08-31","arxiv_id":"2008.13539","n_code_links":0,"syntology":null},{"paper":null,"slug":"k-way-p-spectral-clustering-on-grassmann","title":"Multiway $p$-spectral graph cuts on Grassmann manifolds","date":"2020-08-30","arxiv_id":"2008.13210","n_code_links":0,"syntology":null},{"paper":null,"slug":"kcoremotif-an-efficient-graph-clustering","title":"KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs","date":"2020-08-21","arxiv_id":"2008.10380","n_code_links":0,"syntology":null},{"paper":null,"slug":"community-models-for-partially-observed","title":"Community models for networks observed through edge nominations","date":"2020-08-09","arxiv_id":"2008.03652","n_code_links":0,"syntology":null},{"paper":null,"slug":"community-detection-in-sparse-latent-space","title":"Community detection in sparse latent space models","date":"2020-08-04","arxiv_id":"2008.01375","n_code_links":0,"syntology":null},{"paper":null,"slug":"tractably-modelling-dependence-in-networks","title":"Tractably Modelling Dependence in Networks Beyond Exchangeability","date":"2020-07-28","arxiv_id":"2007.14365","n_code_links":0,"syntology":null},{"paper":null,"slug":"scaling-graph-clustering-with-distributed","title":"Scaling Graph Clustering with Distributed Sketches","date":"2020-07-24","arxiv_id":"2007.12669","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-manifold-proximal-linear-method-for-sparse","title":"A Manifold Proximal Linear Method for Sparse Spectral Clustering with Application to Single-Cell RNA Sequencing Data Analysis","date":"2020-07-18","arxiv_id":"2007.09524","n_code_links":0,"syntology":null},{"paper":"/paper/summpip-unsupervised-multi-document","slug":"summpip-unsupervised-multi-document","title":"SummPip: Unsupervised Multi-Document Summarization with Sentence Graph Compression","date":"2020-07-17","arxiv_id":"2007.08954","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-performance-guarantee-for-spectral","title":"A Performance Guarantee for Spectral Clustering","date":"2020-07-10","arxiv_id":"2007.05627","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-deep-joint-sparse-non-negative-matrix","title":"A Deep Joint Sparse Non-negative Matrix Factorization Framework for Identifying the Common and Subject-specific Functional Units of Tongue Motion During Speech","date":"2020-07-09","arxiv_id":"2007.04865","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-spectral-clustering-with-nystrom","title":"Scalable Spectral Clustering with Nystrom Approximation: Practical and Theoretical Aspects","date":"2020-06-25","arxiv_id":"2006.14470","n_code_links":0,"syntology":null},{"paper":"/paper/affinity-fusion-graph-based-framework-for","slug":"affinity-fusion-graph-based-framework-for","title":"Affinity Fusion Graph-based Framework for Natural Image Segmentation","date":"2020-06-24","arxiv_id":"2006.13542","n_code_links":2,"syntology":null},{"paper":null,"slug":"consistency-of-anchor-based-spectral","title":"Consistency of Anchor-based Spectral Clustering","date":"2020-06-24","arxiv_id":"2006.13984","n_code_links":0,"syntology":null},{"paper":"/paper/deep-low-rank-subspace-clustering","slug":"deep-low-rank-subspace-clustering","title":"Deep Low-Rank Subspace Clustering","date":"2020-06-18","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-grouped-variable-selection-using","title":"Robust Grouped Variable Selection Using Distributionally Robust Optimization","date":"2020-06-10","arxiv_id":"2006.06094","n_code_links":0,"syntology":null},{"paper":"/paper/cast-a-correlation-based-adaptive-spectral","slug":"cast-a-correlation-based-adaptive-spectral","title":"CAST: A Correlation-based Adaptive Spectral Clustering Algorithm on Multi-scale Data","date":"2020-06-08","arxiv_id":"2006.04435","n_code_links":1,"syntology":null},{"paper":null,"slug":"mc2g-an-efficient-algorithm-for-matrix","title":"MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs","date":"2020-06-08","arxiv_id":"2006.04373","n_code_links":0,"syntology":null},{"paper":null,"slug":"average-sensitivity-of-spectral-clustering","title":"Average Sensitivity of Spectral Clustering","date":"2020-06-07","arxiv_id":"2006.04094","n_code_links":0,"syntology":null},{"paper":"/paper/generalized-spectral-clustering-via-gromov","slug":"generalized-spectral-clustering-via-gromov","title":"Generalized Spectral Clustering via Gromov-Wasserstein Learning","date":"2020-06-07","arxiv_id":"2006.04163","n_code_links":1,"syntology":null},{"paper":null,"slug":"unsupervised-learning-for-subterranean","title":"Unsupervised Learning for Subterranean Junction Recognition Based on 2D Point Cloud","date":"2020-06-07","arxiv_id":"2006.04225","n_code_links":0,"syntology":null},{"paper":null,"slug":"speaker-diarization-with-session-level","title":"Speaker diarization with session-level speaker embedding refinement using graph neural networks","date":"2020-05-22","arxiv_id":"2005.11371","n_code_links":0,"syntology":null},{"paper":"/paper/deep-learning-for-community-detection","slug":"deep-learning-for-community-detection","title":"Deep Learning for Community Detection: Progress, Challenges and Opportunities","date":"2020-05-17","arxiv_id":"2005.08225","n_code_links":1,"syntology":null},{"paper":null,"slug":"detecting-latent-communities-in-network","title":"Detecting Latent Communities in Network Formation Models","date":"2020-05-07","arxiv_id":"2005.03226","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-view-spectral-clustering-tailored","title":"Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation","date":"2020-04-30","arxiv_id":"2004.14705","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-graph-clustering-with-network-lasso","title":"Local Graph Clustering with Network Lasso","date":"2020-04-25","arxiv_id":"2004.12199","n_code_links":0,"syntology":null},{"paper":null,"slug":"randomized-spectral-co-clustering-for-large","title":"Randomized spectral co-clustering for large-scale directed networks","date":"2020-04-25","arxiv_id":"2004.12164","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-early-warning-sign-of-critical-transition","title":"An Early Warning Sign of Critical Transition in The Antarctic Ice Sheet -- A Data Driven Tool for Spatiotemporal Tipping Point","date":"2020-04-21","arxiv_id":"2004.09724","n_code_links":0,"syntology":null},{"paper":null,"slug":"strong-consistency-graph-laplacians-and-the","title":"Strong Consistency, Graph Laplacians, and the Stochastic Block Model","date":"2020-04-21","arxiv_id":"2004.09780","n_code_links":0,"syntology":null},{"paper":"/paper/hyperspectral-image-clustering-with-spatially","slug":"hyperspectral-image-clustering-with-spatially","title":"Hyperspectral Image Clustering with Spatially-Regularized Ultrametrics","date":"2020-04-10","arxiv_id":"2004.05048","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-spectral-clustering-using-lasso","title":"Robust spectral clustering using LASSO regularization","date":"2020-04-08","arxiv_id":"2004.03845","n_code_links":0,"syntology":null},{"paper":"/paper/motif-based-spectral-clustering-of-weighted","slug":"motif-based-spectral-clustering-of-weighted","title":"Motif-Based Spectral Clustering of Weighted Directed Networks","date":"2020-04-02","arxiv_id":"2004.01293","n_code_links":3,"syntology":null},{"paper":null,"slug":"company-classification-using-machine-learning","title":"Company classification using machine learning","date":"2020-03-31","arxiv_id":"2004.01496","n_code_links":0,"syntology":null},{"paper":"/paper/a-unified-framework-for-spectral-clustering","slug":"a-unified-framework-for-spectral-clustering","title":"A unified framework for spectral clustering in sparse graphs","date":"2020-03-20","arxiv_id":"2003.09198","n_code_links":1,"syntology":null},{"paper":null,"slug":"unsupervised-machine-learning-of-quantum","title":"Unsupervised machine learning of quantum phase transitions using diffusion maps","date":"2020-03-16","arxiv_id":"2003.07399","n_code_links":0,"syntology":null},{"paper":"/paper/auto-tuning-spectral-clustering-for-speaker","slug":"auto-tuning-spectral-clustering-for-speaker","title":"Auto-Tuning Spectral Clustering for Speaker Diarization Using Normalized Maximum Eigengap","date":"2020-03-05","arxiv_id":"2003.02405","n_code_links":1,"syntology":null},{"paper":null,"slug":"sparse-and-smooth-improved-guarantees-for","title":"Sparse and Smooth: improved guarantees for Spectral Clustering in the Dynamic Stochastic Block Model","date":"2020-02-07","arxiv_id":"2002.02892","n_code_links":0,"syntology":null},{"paper":"/paper/simultaneous-prediction-and-community","slug":"simultaneous-prediction-and-community","title":"Simultaneous prediction and community detection for networks with application to neuroimaging","date":"2020-02-05","arxiv_id":"2002.01645","n_code_links":1,"syntology":null},{"paper":"/paper/discovery-of-self-assembling-conjugated","slug":"discovery-of-self-assembling-conjugated","title":"Discovery of Self-Assembling $π$-Conjugated Peptides by Active Learning-Directed Coarse-Grained Molecular Simulation","date":"2020-01-27","arxiv_id":"2002.01563","n_code_links":1,"syntology":null},{"paper":null,"slug":"randomized-spectral-clustering-in-large-scale","title":"Randomized Spectral Clustering in Large-Scale Stochastic Block Models","date":"2020-01-20","arxiv_id":"2002.00839","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-group-norm-regularized-lrr-factorization","title":"A Group Norm Regularized Factorization Model for Subspace Segmentation","date":"2020-01-08","arxiv_id":"2001.02568","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-subspace-clustering-with-entropy-norm","title":"Sparse Subspace Clustering with Entropy-Norm","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"constructing-the-f-graph-with-a-symmetric","title":"Constructing the F-Graph with a Symmetric Constraint for Subspace Clustering","date":"2019-12-17","arxiv_id":"1912.07871","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-robust-spectral-clustering-algorithm-for","title":"A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers","date":"2019-12-16","arxiv_id":"1912.07546","n_code_links":0,"syntology":null},{"paper":null,"slug":"temporal-wasserstein-non-negative-matrix","title":"Temporal Wasserstein non-negative matrix factorization for non-rigid motion segmentation and spatiotemporal deconvolution","date":"2019-12-07","arxiv_id":"1912.03463","n_code_links":0,"syntology":null},{"paper":null,"slug":"improved-analysis-of-spectral-algorithm-for","title":"Improved Analysis of Spectral Algorithm for Clustering","date":"2019-12-06","arxiv_id":"1912.02997","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-view-subspace-clustering-via-partition","title":"Multi-view Subspace Clustering via Partition Fusion","date":"2019-12-03","arxiv_id":"1912.01201","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-laplacian-regularization-for-sparse","title":"Optimal Laplacian regularization for sparse spectral community detection","date":"2019-12-03","arxiv_id":"1912.01419","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-word-ratings-for-empathy-and","title":"Learning Word Ratings for Empathy and Distress from Document-Level User Responses","date":"2019-12-02","arxiv_id":"1912.01079","n_code_links":0,"syntology":null},{"paper":"/paper/selective-sampling-based-scalable-sparse","slug":"selective-sampling-based-scalable-sparse","title":"Selective Sampling-based Scalable Sparse Subspace Clustering","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/spectral-modification-of-graphs-for-improved","slug":"spectral-modification-of-graphs-for-improved","title":"Spectral Modification of Graphs for Improved Spectral Clustering","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"lifelong-spectral-clustering","title":"Lifelong Spectral Clustering","date":"2019-11-27","arxiv_id":"1911.11908","n_code_links":0,"syntology":null},{"paper":null,"slug":"network-embedding-an-overview","title":"Network Embedding: An Overview","date":"2019-11-26","arxiv_id":"1911.11726","n_code_links":0,"syntology":null},{"paper":null,"slug":"graspel-graph-spectral-learning-at-scale-1","title":"GRASPEL: Graph Spectral Learning at Scale","date":"2019-11-23","arxiv_id":"1911.10373","n_code_links":0,"syntology":null}],"record_sha256":"ba58aa3e258851e96788801cb56b4cba0db9c87d15a517ead18eb6e8436949c5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}