{"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":"/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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":30,"of":30,"of_with_code":15,"tagged_in_all":30,"counts":{"archive_papers_tagged":30,"with_a_code_link":15,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":30,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[{"url":"/paper/a-parameter-free-graph-reduction-for-spectral","slug":"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/random-projection-tree-similarity-metric-for","slug":"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/approximate-spectral-clustering-density-based","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","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,"repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-clustering-based-on-evidence","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"symmetric-nonnegative-matrix-factorization","title":"Symmetric Nonnegative Matrix Factorization for Graph Clustering","date":"2012-02-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"modular-training-of-neural-networks-aids","title":"Modular Training of Neural Networks aids Interpretability","date":"2025-02-04","arxiv_id":"2502.02470","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-to-five-truths-in-non-negative-matrix","title":"Two to Five Truths in Non-Negative Matrix Factorization","date":"2023-05-06","arxiv_id":"2305.05389","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-a-fast-3d-spectral-approach-to","title":"Learning a Fast 3D Spectral Approach to Object Segmentation and Tracking over Space and Time","date":"2022-12-15","arxiv_id":"2212.08058","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimalistic-unsupervised-learning-with-the","title":"Minimalistic Unsupervised Learning with the Sparse Manifold Transform","date":"2022-09-30","arxiv_id":"2209.15261","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-graph-clustering-for-intentional","title":"Spectral Graph Clustering for Intentional Islanding Operations in Resilient Hybrid Energy Systems","date":"2022-03-13","arxiv_id":"2203.06579","repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-nonlinear-eigenfunctions-via","title":"Computing Nonlinear Eigenfunctions via Gradient Flow Extinction","date":"2019-02-27","arxiv_id":"1902.10414","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-a-two-truths-phenomenon-in-spectral-graph","title":"On a 'Two Truths' Phenomenon in Spectral Graph Clustering","date":"2018-08-23","arxiv_id":"1808.07801","repositories_listed":0,"syntology":null},{"url":null,"slug":"normalized-cut-with-adaptive-similarity-and","title":"A Variational Image Segmentation Model based on Normalized Cut with Adaptive Similarity and Spatial Regularization","date":"2018-06-06","arxiv_id":"1806.01977","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theoretical-investigation-of-graph-degree","title":"A Theoretical Investigation of Graph Degree as an Unsupervised Normality Measure","date":"2018-01-24","arxiv_id":"1801.07889","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-spectral-graph-clustering-with","title":"Revisiting Spectral Graph Clustering with Generative Community Models","date":"2017-09-14","arxiv_id":"1709.04594","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilayer-spectral-graph-clustering-via-1","title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms","date":"2017-08-08","arxiv_id":"1708.02620","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilayer-spectral-graph-clustering-via","title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation","date":"2016-09-23","arxiv_id":"1609.07200","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-recovery-in-shuffled-graphs-via","title":"Information Recovery in Shuffled Graphs via Graph Matching","date":"2016-05-08","arxiv_id":"1605.02315","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-eigen-updating-for-spectral-graph","title":"Efficient Eigen-updating for Spectral Graph Clustering","date":"2013-01-07","arxiv_id":"1301.1318","repositories_listed":0,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"61452336629dc9ae18d01afc4b4ba88352e471d1fb5a544d6388a6f03353fd48","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}