可伸缩约束聚类:一种广义谱方法
Scalable Constrained Clustering: A Generalized Spectral Method
摘要:
我们提出了一个原则性的谱方法研究约束聚类问题。它将聚类问题归结为拉普拉斯算子上的广义特征值问题。该方法工作在接近线性的时间,并提供了具体的保证质量的集群,至少在2路分区的情况下。在实践中,这转化为非常快的实现,始终优于现有的频谱方法。我们通过在各种数据集上的实验来支持这一说法:我们的方法在以前的方法失败的例子中恢复了正确的集群,并处理了数百万个数据点的数据集-比以前大了两个数量级。
英文摘要:
We present a principled spectral approach to the well-studied constrained clustering problem. It reduces clustering to a generalized eigenvalue problem on Laplacians. The method 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. We support this claim with experiments on various data sets: our approach recovers correct clusters in examples where previous methods fail, and handles data sets with millions of data points - two orders of magnitude larger than before.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。