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...
1. autor: | Cucuringu, M |
---|---|
Format: | Conference item |
Wydane: |
Microtome Publishing
2016
|
Podobne zapisy
-
Ultra-scalable spectral clustering and ensemble clustering
od: Huang, Dong, i wsp.
Wydane: (2020) -
Motif-based spectral clustering of weighted directed networks
od: Underwood, WG, i wsp.
Wydane: (2020) -
Motif-based spectral clustering of weighted directed networks
od: William G. Underwood, i wsp.
Wydane: (2020-09-01) -
Coherency-Constrained Spectral Clustering for Power Network Reduction
od: Mario D. Baquedano-Aguilar, i wsp.
Wydane: (2025-01-01) -
SPONGE: A generalized eigenproblem for clustering signed networks
od: Cucuringu, M, i wsp.
Wydane: (2019)