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...
मुख्य लेखक: | Cucuringu, M |
---|---|
स्वरूप: | Conference item |
प्रकाशित: |
Microtome Publishing
2016
|
समान संसाधन
-
Ultra-scalable spectral clustering and ensemble clustering
द्वारा: Huang, Dong, और अन्य
प्रकाशित: (2020) -
Motif-based spectral clustering of weighted directed networks
द्वारा: Underwood, WG, और अन्य
प्रकाशित: (2020) -
Motif-based spectral clustering of weighted directed networks
द्वारा: William G. Underwood, और अन्य
प्रकाशित: (2020-09-01) -
Coherency-Constrained Spectral Clustering for Power Network Reduction
द्वारा: Mario D. Baquedano-Aguilar, और अन्य
प्रकाशित: (2025-01-01) -
SPONGE: A generalized eigenproblem for clustering signed networks
द्वारा: Cucuringu, M, और अन्य
प्रकाशित: (2019)