Big-Data Clustering: K-Means or K-Indicators?
From MaRDI portal
Publication:6319873
arXiv1906.00938MaRDI QIDQ6319873
Author name not available (Why is that?)
Publication date: 3 June 2019
Abstract: The K-means algorithm is arguably the most popular data clustering method, commonly applied to processed datasets in some "feature spaces", as is in spectral clustering. Highly sensitive to initializations, however, K-means encounters a scalability bottleneck with respect to the number of clusters K as this number grows in big data applications. In this work, we promote a closely related model called K-indicators model and construct an efficient, semi-convex-relaxation algorithm that requires no randomized initializations. We present extensive empirical results to show advantages of the new algorithm when K is large. In particular, using the new algorithm to start the K-means algorithm, without any replication, can significantly outperform the standard K-means with a large number of currently state-of-the-art random replications.
Has companion code repository: https://github.com/yangyuchen0340/Kind
This page was built for publication: Big-Data Clustering: K-Means or K-Indicators?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6319873)
