Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference39 articles.
1. Clustering for metric and nonmetric distance measures;Ackermann;ACM Transactions on Algorithms,2010
2. A. Aggarwal, A. Deshpande, R. Kannan, Adaptive sampling for k-means clustering, in: Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems & the 13th International Workshop on Randomization and Computation, 2009, pp. 15–28.
3. S. Arora, P. Raghavan, S. Rao, Approximation schemes for Euclidean k-medians and related problems, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 106–113.
4. D. Arthur, S. Vassilvitskii, k-means++: The advantages of careful seeding, in: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1027–1035.
5. Local search heuristics for k-median and facility location problems;Arya;SIAM Journal on Computing,2004
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献