Approximate K-Means++ in sublinear time

30th AAAI Conference on Artificial Intelligence, AAAI 2016

Volumn , Issue , 2016, Pages 1459-1467

  Bachem, Olivier ^a   Lucic, Mario ^a   Hassani, S Hamed ^a   Krause, Andreas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLUSTERING ALGORITHMS; MARKOV PROCESSES; MONTE CARLO METHODS;

K-MEANS CLUSTERING; LARGE-SCALE DATASETS; MARKOV CHAIN MONTE CARLO SAMPLINGS; MASSIVE DATA SETS; NUMBER OF DATUM; OPTIMAL SOLUTIONS; ORDERS OF MAGNITUDE; THEORETICAL GUARANTEES;

NONLINEAR EQUATIONS;

EID: 84988622349     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Ackermann, M. R.; Martens, M.; Raupach, C.; Swierkot, K.; Lammersen, C.; and Sohler, C. 2012. StreamKM++: A clustering algorithm for data streams. Journal of Experimental Algorithmics 17:2-4.
2. Agarwal, M.; Jaiswal, R.; and Pal, A. 2013. k-means++ under approximation stability. In Theory and Applications of Models of Computation. Springer. 84-95.
3. Aggarwal, A.; Deshpande, A.; and Kannan, R. 2009. Adaptive sampling for k-means clustering. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer. 15-28.
4. Ailon, N.; Jaiswal, R.; and Monteleoni, C. 2009. Streaming kmeans approximation. In Advances in Neural Information Processing Systems (NIPS), 10-18.
5. Arthur, D., and Vassilvitskii, S. 2007. k-means++: The advantages of careful seeding. In Symposium on Discrete Algorithms (SODA), 1027-1035. Society for Industrial and Applied Mathematics.
6. Bachem, O.; Lucic, M.; and Krause, A. 2015. Coresets for nonparametric estimation -The case of DP-means. In International Conference on Machine Learning (ICML).
7. Bahmani, B.; Moseley, B.; Vattani, A.; Kumar, R.; and Vassilvitskii, S. 2012. Scalable k-means++. Very Large Data Bases (VLDB) 5(7):622-633.
8. Balcan, M.-F.; Blum, A.; and Gupta, A. 2009. Approximate clustering without the approximation. In Symposium on Discrete Algorithms (SODA), 1068-1077. Society for Industrial and Applied Mathematics.
9. Bertin-Mahieux, T.; Ellis, D. P.; Whitman, B.; and Lamere, P. 2011. The Million Song Dataset. In International Conference on Music Information Retrieval.
10. Bottou, L., and Bengio, Y. 1994. Convergence properties of the kmeans algorithms. In Advances in Neural Information Processing Systems (NIPS), 585-592.
11. Braverman, V.; Meyerson, A.; Ostrovsky, R.; Roytman, A.; Shindler, M.; and Tagiku, B. 2011. Streaming k-means on wellclusterable data. In Symposium on Discrete Algorithms (SODA), 26-40. Society for Industrial and Applied Mathematics.
12. Brunsch, T., and Roglin, H. 2011. A bad instance for k-means++. In Theory and Applications of Models of Computation. Springer. 344-352.
13. Cai, H. 2000. Exact bound for the convergence of Metropolis chains. Stochastic Analysis and Applications 18(1):63-71.
14. Coates, A., and Ng, A. Y. 2012. Learning feature representations with k-means. In Neural Networks: Tricks of the Trade. Springer. 561-580.
15. Coates, A.; Lee, H.; and Ng, A. Y. 2011. An analysis of singlelayer networks in unsupervised feature learning. In International Conference on Artificial Intelligence and Statistics (AISTATS), volume 1001.
16. Faulkner, M.; Olson, M.; Chandy, R.; Krause, J.; Chandy, K. M.; and Krause, A. 2011. The next big one: Detecting earthquakes and other rare events from community-based sensors. In ACM/IEEE International Conference on Information Processing in Sensor Networks.
17. Guha, S.; Meyerson, A.; Mishra, N.; Motwani, R.; and O'Callaghan, L. 2003. Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering 15(3):515-528.
18. Hastings, W. K. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1):97-109.
19. Jaiswal, R., and Garg, N. 2012. Analysis of k-means++ for separable data. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer. 591-602.
20. Jaiswal, R.; Kumar, A.; and Sen, S. 2014. A simple D2-sampling based PTAS for k-means and other clustering problems. Algorithmica 70(1):22-46.
21. Jaiswal, R.; Kumar, M.; and Yadav, P. 2015. Improved analysis of D2-sampling based PTAS for k-means and other clustering problems. Information Processing Letters 115(2):100-103.
22. KDD Cup. 2004. Protein Homology Dataset. Retrieved from osmot.cs.cornell.edu/kddcup.
23. Kulis, B., and Jordan, M. I. 2012. Revisiting k-means: New algorithms via Bayesian nonparametrics. In International Conference on Machine Learning (ICML), 513-520.
24. Lloyd, S. 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory 28(2):129-137.
25. Ostrovsky, R.; Rabani, Y.; Schulman, L. J.; and Swamy, C. 2006. The effectiveness of Lloyd-Type methods for the k-means problem. In Foundations of Computer Science (FOCS), 165-176. IEEE.
26. Pollard, D. 1981. Strong consistency of k-means clustering. The Annals of Statistics 9(1):135-140.
27. Sculley, D. 2010. Web-scale k-means clustering. In World Wide Web Conference (WWW), 1177-1178. ACM.
28. Shindler, M.; Wong, A.; and Meyerson, A. W. 2011. Fast and accurate k-means for large datasets. In NIPS, 2375-2383.
29. United States Geological Survey. 2010. Global Earthquakes (1.1.1972-19.3.2010). Retrieved from the mldata.org repository.
30. Wu, X.; Kumar, V.; Ross Quinlan, J.; Ghosh, J.; Yang, Q.; Motoda, H.; McLachlan, G.; Ng, A.; Liu, B.; Yu, P.; Zhou, Z.-H.; Steinbach, M.; Hand, D.; and Steinberg, D. 2008. Top 10 algorithms in data mining. Knowledge and Information Systems 14(1):1-37.
31. Yahoo Labs. 2008. R6A - Yahoo Front Page Today Module User Click Log Dataset. Retrieved from research.yahoo.com repository.
32. Zhao, W.; Ma, H.; and He, Q. 2009. Parallel k-means clustering based on MapReduce. In Cloud Computing. Springer. 674-679.