论文信息 - A Streaming Algorithm for k-Means with Approximate Coreset

A Streaming Algorithm for k-Means with Approximate Coreset

For computing the k-means clustering of the streaming and distributed big sparse data, we present an algorithm to obtain the sparse coreset for the k-means in polynomial time. This algorithm is mai...

Dongmei Zhang | Dachuan Xu | Min Li | Tong Zhang

[1] José Antonio Lozano,et al. An efficient approximation to the K-means clustering for massive data , 2017, Knowl. Based Syst..

[2] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[3] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[4] Kamesh Munagala,et al. Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[5] Pankaj K. Agarwal,et al. Approximating extent measures of points , 2004, JACM.

[6] Euiwoong Lee,et al. Improved and simplified inapproximability for k-means , 2015, Inf. Process. Lett..

[7] Ke Chen,et al. On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications , 2009, SIAM J. Comput..

[8] C. Greg Plaxton,et al. Optimal Time Bounds for Approximate Clustering , 2002, Machine Learning.

[9] Rafail Ostrovsky,et al. Polynomial-time approximation schemes for geometric min-sum median clustering , 2002, JACM.