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: | |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
Microtome Publishing
2016
|