Methods › General › Clustering › Spectral Clustering

Spectral Clustering

517 papers tagged archive 2025-07-28

Introduced by Ulrike von Luxburg in A Tutorial on Spectral Clustering

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Spectral clustering has attracted increasing attention due to the 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,

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: 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).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 517 · with a code link: 136 · where Syntology ran a sample: 20 (16 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (20 of 517 tagged: 16 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument)

Page 1 of 6: papers 1 to 100 of 517, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 244 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Clustering465
Community Detection48
Stochastic Block Model48
Graph Clustering33
Semantic Segmentation27
Dimensionality Reduction21
Segmentation20
graph partitioning19
Computational Efficiency15
Image Segmentation15
Graph Embedding12
Object11
Speaker Diarization11
Spectral Graph Clustering11
speaker-diarization11
Image Clustering10
Motion Segmentation10
Representation Learning10
Deep Clustering9
General Classification9

Usage over time archive 2025-07-28

Papers per year tagged with Spectral Clustering: 2007 to 2025, peak 72 72 0 2007: 1 paper 2007 2008: 2 papers 2009: 0 papers 2009 2010: 0 papers 2011: 4 papers 2011 2012: 5 papers 2013: 11 papers 2013 2014: 21 papers 2015: 26 papers 2015 2016: 20 papers 2017: 33 papers 2017 2018: 34 papers 2019: 72 papers 2019 2020: 65 papers 2021: 43 papers 2021 2022: 48 papers 2023: 51 papers 2023 2024: 55 papers 2025: 26 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (517 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Clustering

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections