Simple and scalable constrained clustering: a generalized spectral method
We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least...
Huvudupphovsman: | Cucuringu, M |
---|---|
Materialtyp: | Conference item |
Publicerad: |
Microtome Publishing
2016
|
Liknande verk
Liknande verk
-
Ultra-scalable spectral clustering and ensemble clustering
av: Huang, Dong, et al.
Publicerad: (2020) -
Motif-based spectral clustering of weighted directed networks
av: Underwood, WG, et al.
Publicerad: (2020) -
Motif-based spectral clustering of weighted directed networks
av: William G. Underwood, et al.
Publicerad: (2020-09-01) -
Coherency-Constrained Spectral Clustering for Power Network Reduction
av: Mario D. Baquedano-Aguilar, et al.
Publicerad: (2025-01-01) -
SPONGE: A generalized eigenproblem for clustering signed networks
av: Cucuringu, M, et al.
Publicerad: (2019)