Simple and Scalable Constrained Clustering: a Generalized Spectral Method.
JMLR Workshop and Conference Proceedings(2016)
摘要
We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem in which both matrices are graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least for the case of 2-way partitioning. In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络