Using the Triangle Inequality to Accelerate k-Means

Proceedings, Twentieth International Conference on Machine Learning

Volumn 1, Issue , 2003, Pages 147-153

  Elkan, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERS; TRIANGULAR INEQUALITY;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ITERATIVE METHODS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; MOLECULAR STRUCTURE; OPTIMIZATION; PROTEINS;

DATA REDUCTION;

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

References (31)

1. Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001). On the surprising behavior of distance metrics in high dimensional spaces. Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings (pp. 420-434). Springer.
2. Alsabti, K., Ranka, S., & Singh, V. (1998). An efficient k-means clustering algorithm. IPPS/SPDP Workshop on High Performance Data Mining. IEEE Computer Society Press.
3. Bei, C.-D., & Gray, R. M. (1985). An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Transactions on Communications, 33, 1132-1133.
4. Burkhard, W. A., & Keller, R. M. (1973). Some approaches to best-match file searching. Communications of the ACM, 16, 230-236.
5. Cheng, D.-Y., Gersho, A., Ramamurthi, B., & Shoham, Y. (1984). Fast search algorithms for vector quantization and pattern matching. International Conference on Acoustics, Speech and Signal Processing (ICASSP) (pp. 9.11.1-9.11.4). IEEE Computer Society Press.
6. Dasgupta, S. (2000). Experiments with random projection. Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI'00) (pp. 143-151). Morgan Kaufmann.
7. Dasgupta, S. (2002). Performance guarantees for hierarchical clustering. Fifteenth Annual Conference on Computational Learning Theory (COLT'02) (pp. 351-363). Springer Verlag.
8. Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39, 1-38.
9. Deng, K., & Moore, A. W. (1993). Multiresolution instance-based learning. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (pp. 1233-1239). San Francisco: Morgan Kaufmann.
10. Faber, V. (1994). Clustering and the continuous k-means algorithm. Los Alamos Science, 138-144.
11. Farnstrom, F., Lewis, J., & Elkan, C. (2000). Scalability for clustering algorithms revisited. ACM SIGKDD Explorations, 2, 51-57.
12. Hamerly, G., & Elkan, C. (2002). Alternatives to the k-means algorithm that find better clusterings. Proceedings of the Eleventh International Conference on Information and Knowledge Management (pp. 600-607). McLean, Virginia, USA: ACM Press.
13. Hodgson, M. E. (1988). Reducing computational requirements of the minimum-distance classifier. Remote Sensing of Environments, 25, 117-128.
14. Indyk, P., Amir, A., Efrat, A., & Samet, H. (1999). Efficient algorithms and regular data structures for dilation, location and proximity problems. Proceedings of the Annual Symposium on Foundations of Computer Science (pp. 160-170).
15. Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: Towards removing the curse of dimensionality. Proceedings of the Annual ACM Symposium on the Theory of Computing (pp. 604-613).
16. Judd, D., McKinley, P. K., & Jain, A. K. (1998). Large-scale parallel data clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20, 871-876.
17. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2000). The analysis of a simple k-means clustering algorithm. ACM Symposium on Computational Geometry (pp. 100-109). ACM Press.
18. Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28, 129-137.
19. MacQueen, J. B. (1965). On convergence of k-means and partitions with minimum average variance. Annals of Mathematical Statistics, 36, 1084. Abstract only.
20. McNames, J. (2000). Rotated partial distance search for faster vector quantization encoding. IEEE Signal Processing Letters, 7, 244-246.
21. Mielikainen, J. (2002). A novel full-search vector quantization algorithm based on the law of cosines. IEEE Signal Processing Letters, 9, 175-176.
22. Monge, A. E., & Elkan, C. P. (1996). The field matching problem: Algorithms and applications. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (pp. 267-270). Portland, Oregon: AAAI Press (distributed by MIT Press).
23. Montolio, P., Gasull, A., Monte, E., Torres, L., & Marques, F. (1992). Analysis and optimization of the k-means algorithm for remote sensing applications. In A. Sanfeliu (Ed.), Pattern recognition and image analysis, 155-170. World Scientific.
24. Moore, A. W. (2000). The anchors hierarchy: Using the triangle inequality to survive high dimensional data. Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (pp. 397-405). Morgan Kaufmann.
25. Orchard, M. T. (1991). A fast nearest-neighbor search algorithm. International Conference on Acoustics, Speech and Signal Processing (ICASSP) (pp. 2297-2300). IEEE Computer Society Press.
26. Pelleg, D., & Moore, A. (1999). Accelerating exact k-means algorithms with geometric reasoning. Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99) (pp. 277-281).
27. Phillips, S. J. (2002). Acceleration of k-means and related clustering algorithms. Fourth International Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 166-177). Springer Verlag.
28. Ramasubramanian, V., & Paliwal, K. K. (1990). A generalized optimization of the k - d tree for fast nearest-neighbour search. Fourth IEEE Region 10 International Conference (TENCON'89) (pp. 565-568). IEEE Computer Society Press.
29. Vidal, E. (1986). An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recognition Letters, 4, 145-157.
30. Wu, K.-S., & Lin, J.-C. (2000). Fast VQ encoding by an efficient kick-out condition. IEEE Transactions on Circuits and Systems for Video Technology, 10, 59-62.
31. Zhang, T., Ramakrishnan, R., & Livny, M. (1996). BIRCH: an efficient data clustering method for very large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 103-114). ACM Press.