Web-scale k-means clustering

Proceedings of the 19th International Conference on World Wide Web, WWW '10

Volumn , Issue , 2010, Pages 1177-1178

  Sculley, D ^a  

^a GOOGLE INC   (United States)

Author keywords

scalability; sparse solutions; unsupervised clustering

Indexed keywords

BATCH ALGORITHMS; BATCH OPTIMIZATION; COMPUTATION COSTS; K-MEANS CLUSTERING; K-MEANS CLUSTERING ALGORITHM; ORDERS OF MAGNITUDE; PROJECTED GRADIENT; SOURCE CODES; SPARSE SOLUTIONS; STOCHASTIC GRADIENT DESCENT; UNSUPERVISED CLUSTERING; WEB APPLICATION;

COST REDUCTION; SCALABILITY; WATER SUPPLY SYSTEMS; WORLD WIDE WEB;

CLUSTERING ALGORITHMS;

EID: 77954583359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1772690.1772862     Document Type: Conference Paper

References (6)

1. L. Bottou and Y. Bengio. Convergence properties of the kmeans algorithm. In Advances in Neural Information Processing Systems. 1995.
2. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the l1-ball for learning in high dimensions. In ICML '08: Proceedings of the 25th international conference on Machine learning, 2008.
3. C. Elkan. Using the triangle inequality to accelerate k-means. In ICML '03: Proceedings of the 20th international conference on Machine learning, 2003.
4. D. D. Lewis, Y. Yang, T. G. Rose, and F. Li. Rcv1: A new benchmark collection for text categorization research. J. Mach. Learn. Res., 5, 2004.
5. D. Witten and R. Tibshirani. A framework for feature selection in clustering. To Appear: Journal of the American Statistical Association, 2010.
6. X. Wu and V. Kumar. The Top Ten Algorithms in Data Mining. Chapman & Hall/CRC, 2009.