{"url":"/task/spectral-graph-clustering","name":"Spectral Graph Clustering","slug":"spectral-graph-clustering","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":30,"papers_with_code":15,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":15,"of":15,"tagged_in_all":30,"items":[{"url":"/paper/random-projection-tree-similarity-metric-for","title":"Random projection tree similarity metric for SpectralNet","date":"2023-02-25","arxiv_id":"2302.13168","repositories_listed":1,"syntology":null},{"url":"/paper/a-parameter-free-graph-reduction-for-spectral","title":"A parameter-free graph reduction for spectral clustering and SpectralNet","date":"2023-02-25","arxiv_id":"2302.13165","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-density-based","title":"Approximate spectral clustering density-based similarity for noisy datasets","date":"2023-02-22","arxiv_id":"2302.11298","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-with","title":"Approximate spectral clustering with eigenvector selection and self-tuned $k$","date":"2023-02-22","arxiv_id":"2302.11297","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-k-nearest-neighbor-graph-for-a","title":"Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering","date":"2023-02-22","arxiv_id":"2302.11296","repositories_listed":1,"syntology":null},{"url":"/paper/learning-co-segmentation-by-segment-swapping","title":"Learning Co-segmentation by Segment Swapping for Retrieval and Discovery","date":"2021-10-29","arxiv_id":"2110.15904","repositories_listed":1,"syntology":null},{"url":"/paper/latent-structure-blockmodels-for-bayesian","title":"Latent structure blockmodels for Bayesian spectral graph clustering","date":"2021-07-04","arxiv_id":"2107.01734","repositories_listed":1,"syntology":null},{"url":"/paper/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,"repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-clustering-based-on-evidence","title":"Ensemble clustering based on evidence extracted from the co-association matrix","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-dimensionality-and-complexity","title":"Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering","date":"2019-04-05","arxiv_id":"1904.02926","repositories_listed":1,"syntology":null},{"url":"/paper/an-internal-validity-index-based-on-density","title":"An Internal Validity Index Based on Density-Involved Distance","date":"2019-03-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clear-a-consistent-lifting-embedding-and","title":"CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification Algorithm for Multi-View Data Association","date":"2019-02-06","arxiv_id":"1902.02256","repositories_listed":1,"syntology":null},{"url":"/paper/amos-an-automated-model-order-selection","title":"AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering","date":"2016-09-21","arxiv_id":"1609.06457","repositories_listed":1,"syntology":null},{"url":"/paper/phase-transitions-and-a-model-order-selection","title":"Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering","date":"2016-04-11","arxiv_id":"1604.03159","repositories_listed":1,"syntology":null},{"url":"/paper/symmetric-nonnegative-matrix-factorization","title":"Symmetric Nonnegative Matrix Factorization for Graph Clustering","date":"2012-02-27","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}