Author:
Cai Ruichu,Zhang Zhenjie,Tung Anthony K.H.,Dai Chenyun,Hao Zhifeng
Funder
Natural Science Foundation of China
Subject
Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software
Reference44 articles.
1. Streamkm++: a clustering algorithm for data streams;Ackermann;J. Exp. Algorithmics,2012
2. S. Arora, P. Raghavan, S. Rao, Approximation schemes for euclidean k-medians and related problems, in: Proceedings of the Annual ACM Symposium on Theory of Computing, 1998, pp. 106–113.
3. D. Arthur, S. Vassilvitskii, How slow is the k-means method? in: Proceedings of the 30th Annual Symposium on Computational Geometry, 2006, pp. 144–153.
4. D. Arthur, S. Vassilvitskii, k-Means++: the advantage of careful seeding, in: Proceedings of the Annual ACM–SIAM Symposium on Discrete Algorithms, 2007.
5. V. Arya, N. Garg, R. Khandekar, K. Munagala, V. Pandit, Local search heuristic for k-median and facility location problems, in: Proceedings of the Annual ACM Symposium on Theory of Computing, 2001, pp. 21–29.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献