{"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/large-scale-spectral-clustering","slug":"large-scale-spectral-clustering","name":"Large-scale spectral clustering","full_name":"Large-scale spectral clustering","full_name_withheld":false,"description_markdown":"# [Spectral Clustering](https://paperswithcode.com/method/spectral-clustering)\r\n\r\nSpectral clustering aims to partition the data points into $k$ clusters using the spectrum of the graph Laplacians \r\nGiven a dataset $X$ with $N$ data points, spectral clustering algorithm first constructs similarity matrix ${W}$, where ${w_{ij}}$ indicates the similarity between data points $x_i$ and $x_j$ via a similarity measure metric.\r\n\r\nLet $L=D-W$, where $L$ is called graph Laplacian and ${D}$ is a diagonal matrix with $d_{ii} = \\sum_ {j=1}^n w_{ij}$.\r\nThe objective function of spectral clustering can be formulated based on the graph Laplacian as follow:\r\n\\begin{equation}\r\n  \\label{eq:SC_obj}\r\n  {\\max_{{U}}  \\operatorname{tr}\\left({U}^{T} {L} {U}\\right)}, \\\\ {\\text { s.t. } \\quad {U}^{T} {{U}={I}}},\r\n\\end{equation}\r\nwhere $\\operatorname{tr(\\cdot)}$ denotes the trace norm of a matrix.\r\nThe rows of matrix ${U}$ are the low dimensional embedding of the original data points.\r\nGenerally, spectral clustering computes ${U}$ as the bottom $k$ eigenvectors of ${L}$, and finally applies $k$-means on ${U}$ to obtain the clustering results.\r\n\r\n\r\n# Large-scale Spectral Clustering\r\n\r\nTo capture the relationship between all data points in $X$, an $N\\times N$ similarity matrix is needed to be constructed in conventional spectral clustering, which costs $O(N^2d)$ time and $O(N^2)$ memory and is not feasible for large-scale clustering tasks.\r\nInstead of a full similarity matrix, many accelerated spectral clustering methods are using a similarity sub-matrix to represent each data points by the cross-similarity between data points and a set of representative data points (i.e., landmarks) via some similarity measures, as\r\n\\begin{equation}\r\n    \\label{eq: cross-similarity}\r\n    B = \\Phi(X,R),\r\n\\end{equation}\r\nwhere $R = \\{r_1,r_2,\\dots, r_p \\}$ ($p \\ll N$) is a set of landmarks with the same dimension to $X$, $\\Phi(\\cdot)$ indicate a similarity measure metric, and $B\\in \\mathbb{R}^{N\\times p}$ is the similarity sub-matrix to represent the $X \\in \\mathbb{R}^{N\\times d}$ with respect to the $R\\in \\mathbb{R}^{p\\times d}$.\r\n\r\nFor large-scale spectral clustering using such similarity matrix,\r\na symmetric similarity matrix $W$ can be designed as \r\n\\begin{equation}\r\n  \\label{eq: WusedB }\r\n  W=\\left[\\begin{array}{ll}\r\n      \\mathbf{0} & B         ; \\\\\r\n      B^{T}      & \\mathbf{0}\r\n    \\end{array}\\right].\r\n\\end{equation}\r\nThe size of matrix $W$ is $(N+p)\\times (N+p)$. \r\nTaking the advantage of the bipartite structure, some fast eigen-decomposition methods can then  be used to obtain the spectral embedding.\r\nFinally, $k$-means is conducted on the embedding to obtain clustering results.\r\n\r\nThe clustering result is directly related to the quality of $B$ that consists of the similarities between data points and landmarks.\r\nThus, the performance of landmark selection is crucial to the clustering result.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Divide-and-conquer based Large-Scale Spectral Clustering","paper":"/paper/divide-and-conquer-based-large-scale-spectral","first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/divide-and-conquer-based-large-scale-spectral"},"source":{"url":"https://www.researchgate.net/publication/351270623_Divide-and-conquer_based_Large-Scale_Spectral_Clustering","title":"Divide-and-conquer based Large-Scale 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":4,"archive_num_papers":5,"papers_newest_first":[{"paper":null,"slug":"clustering-and-classification-of-low","title":"Clustering and classification of low-dimensional data in explicit feature map domain: intraoperative pixel-wise diagnosis of adenocarcinoma of a colon in a liver","date":"2022-03-07","arxiv_id":"2203.03636","n_code_links":0,"syntology":null},{"paper":"/paper/lsec-large-scale-spectral-ensemble-clustering","slug":"lsec-large-scale-spectral-ensemble-clustering","title":"LSEC: Large-scale spectral ensemble clustering","date":"2021-06-18","arxiv_id":"2106.09852","n_code_links":1,"syntology":null},{"paper":"/paper/ultra-scalable-spectral-clustering-and","slug":"ultra-scalable-spectral-clustering-and","title":"Ultra-Scalable Spectral Clustering and Ensemble Clustering","date":"2019-03-04","arxiv_id":"1903.01057","n_code_links":0,"syntology":null},{"paper":"/paper/large-scale-spectral-clustering-using","slug":"large-scale-spectral-clustering-using","title":"Large-scale spectral clustering using diffusion coordinates on landmark-based bipartite graphs","date":"2018-06-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"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"},"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 isolate this method inside it.","pages":[],"tasks":[{"task":"/task/clustering","name":"Clustering","papers":4},{"task":"/task/imagedocument-clustering","name":"Image/Document Clustering","papers":2},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":2},{"task":"/task/incremental-learning","name":"Incremental Learning","papers":1}],"tasks_shown":4,"n_tasks":4,"usage_by_year":[{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":1}],"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/large-scale-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=Large-scale%20spectral%20clustering","read_at":"2026-10-05T00:58:25+00:00","query":"Large-scale 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":null,"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 'Large-scale 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":["Large-Scale-OR","large-scale dataset","large-scale dataset","Two large-scale datasets","LARGE-SCALE EM BENCHMARK","large-scale binary dataset","Multi-kernel spectral clustering","Higher-Order Spectral Clustering"],"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":"e8dc352aca3107cc103f6a9b9d1c14e43a1e0b1418570b9ab32247f6a951ff63","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}