Clustering for metric and nonmetric distance measures

ACM Transactions on Algorithms

Volumn 6, Issue 4, 2010, Pages

  Ackermann, Marcel R ^a   Blömer, Johannes ^a   Sohler, Christian ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

means clustering; median clustering; Approximation algorithm; Bregman divergences; Itakura Saito divergence; Kullback Leibler divergence; Mahalanobis distance; Random sampling

Indexed keywords

BREGMAN DIVERGENCES; ITAKURA-SAITO DIVERGENCE; KULLBACK LEIBLER DIVERGENCE; MAHALANOBIS DISTANCES; RANDOM SAMPLING;

APPROXIMATION ALGORITHMS; SET THEORY; TOPOLOGY;

CLUSTERING ALGORITHMS;

EID: 77956515628     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1824777.1824779     Document Type: Conference Paper

References (39)

1. ACKERMANN, M.R. AND BLÖMER, J. 2009. Coresets and approximate clustering for Bregman divergences. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09). SIAM, 1088-1097.
2. ACKERMANN, M.R., BLÖMER, J., AND SOHLER, C. 2008. Clustering for metric and non-metric distance measures. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08). SIAM, 799-808.
3. ARTHUR, D. AND VASSILVITSKII, S. 2007. κ-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07). SIAM, 1027-1035.
4. BǍDOIU, M., HAR-PELED, S., AND INDYK, P. 2002. Approximate clustering via core-sets. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC'02). ACM, 250-257.
5. BAJAJ, C. L. 1988. The algebraic degree of geometric optimization problems. Discr. Comput. Geom. 3, 1, 177-191.
6. BAKER, L.D. AND MCCALLUM, A. K. 1998. Distributional clustering of words for text classification. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'98). ACM, 96-103.
7. BANERJEE, A., MERUGU, S., DHILLON, I. S., AND GHOSH, J. 2005. Clustering with Bregman divergences. J. Mach. Learn. Res. 6, 1705-1749.
8. BREGMAN, L. M. 1967. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200-217.
9. BUZO, A., GRAY, JR., A., GRAY, R.M., AND MARKEL, J. D. 1980. Speech coding based upon vector quantization. IEEE Trans. Acoust. Speech Signal Process. 28, 5, 562-574. (Pubitemid 11471078)
10. CENSOR, Y. AND ZENIOS, S. A. 1997. Parallel Optimization: Theory, Algorithms, and Applications. Numerical Mathematics and Scientific Computation. Oxford University Press, UK.
11. CHAUDHURI, K. AND MCGREGOR, A. 2008. Finding metric structure in information theoretic clustering. In Proceedings of the 21st Annual Conference on Learning Theory (COLT'08). Omnipress, 391-402.
12. CHEN, K. 2006. On κ-median clustering in high dimensions. In Proceedings of the 17th Annual ACM- SIAM Symposium on Discrete Algorithms (SODA'06). SIAM, 1177-1185.
13. CHEN, K. 2009. On coresets for κ-median and κ-means clustering in metric and Euclidean spaces and their applications. SIAM J. Comput. 39, 3, 923-947.
14. COVER, T.M. AND THOMAS, J. A. 2006. Elements of Information Theory 2nd Ed. Wiley-Interscience, Hoboken, New York.
15. DHILLON, I. S., MALLELA, S., AND KUMAR, R. 2003. A divisive information-theoretic feature clustering algorithm for text classifcation. J. Mach. Learn. Res. 3, 1265-1287.
16. FELDMAN, D., MONEMIZADEH, M., AND SOHLER, C. 2007. A PTAS for κ-means clustering based on weak coresets. In Proceedings ofthe 23rd ACM Symposium on Computational Geometry (SCG'07). ACM, 11-18.
17. FERNANDEZ DE LA VEGA, W., KARPINSKI, M., KENYON, C., AND RABANI, Y. 2003. Approximation schemes for clustering problems. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC'03). ACM, 50-58.
18. GUPTA, A., KRAUTHGAMER, R., AND LEE, J. R. 2003. Bounded geometries, fractals and low-distortion embeddings. In Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS'03). IEEE Computer Society, 534-543.
19. HAR-PELED, S.AND MAZUMDAR, S. 2004. On coresets for κ-means and κ-median clustering. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). ACM, 291-300.
20. INABA, M., KATOH, N., AND IMAI, H. 1994. Applications of weighted Voronoi diagrams and randomization to variance-based κ-clustering. In Proceedings of the 10th ACM Symposium on Computational Geometry (SCG'94). ACM, 332-339.
21. ITAKURA, F. AND SAITO, S. 1968. Analysis synthesis telephony based on the maximum likelihood method. In Reports of the 6th International Congress on Acoustics. Elsevier, 17-20.
22. JAIN, A.K., MURTY, M.N., ANDFLYNN, P. J. 1999. Data clustering: A review. ACM Comput. Surv. 31, 3, 264-323.
23. JAIN, K., MAHDIAN, M., AND SABERI, A. 2002. A new greedy approach for facility location problems. In Proceedings ofthe 34th Annual ACM Symposiumon Theory ofComputing (STOC'02). ACM, 731-740.
24. KOLLIOPOULOS, S.G. AND RAO, S. 1999. A nearly linear-time approximation scheme for the euclidean κ-median problem. In Proceedings of the 7th Annual European Symposium on Algorithms (ESA'99) Springer, 378-389.
25. KULLBACK, S. AND LEIBLER, R. A. 1951. On information and sufficiency. Ann. Math. Statis. 22, 1, 79-86.
26. KUMAR, A., SABHARWAL, Y., AND SEN, S. 2004. A simple linear time (1+∈)-approximation algorithm for κ-means clustering in any dimensions. In Proceedings ofthe 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04). IEEE Computer Society, 454-462.
27. KUMAR, A., SABHARWAL, Y., AND SEN, S. 2005. Linear time algorithms for clustering problems in any dimensions. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05). Springer, 1374-1385.
28. LLOYD, S. P. 1982. Least squares quantization in PCM. IEEE Trans. Inform. Theory 28, 2, 129-137.
29. MAHALANOBIS, P. C. 1936. On the generalized distance in statistics. Proc. National Inst. Sci. India, Vol. 2, 1, 49-55.
30. MATOUŠEK, J. 2000. On approximate geometric κ-clustering. Discr. Comput. Geom. 24, 1, 61-84.
31. MERCER, D. P. 2003. Clustering large datasets. Tech. rep., Linacre College.
32. METTU, R.R. AND PLAXTON, C. G. 2004. Optimal time bounds for approximate clustering. Mach. Learn. 56, 1-3, 35-60.
33. NOCK, R., LUOSTO, P., AND KIVINEN, J. 2008. Mixed Bregman clustering with approximation guarantees. In Proceedings of the European Conference on Machine Learning (ECML'08). Springer, 154-169.
34. OSTROVSKY, R., RABANI, Y., SCHULMAN, L.J., AND SWAMY, C. 2006. The effectiveness of Lloyd-type methods for the κ-means problem. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS'06). IEEE Computer Society, 165-176.
35. PEREIRA, F.C.N., TISHBY, N., AND LEE, L. 1993. Distributional clustering of english words. In Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics (ACL'93). ACL, 183-190.
36. SLONIM, N. AND TISHBY, N. 1999. Agglomerative information bottleneck. In Advances in Neural Information Processing Systems 12 (NIPS 12). The MIT Press, 617-623.
37. SRA, S., JEGELKA, S., AND BANERJEE, A. 2008. Approximation algorithms for Bregman clustering, co-clustering and tensor clustering. Tech. rep. MPIK-TR-177.
38. THORUP, M. 2005. Quick κ-median, κ-center, and facility location for sparse graphs. SIAM J. Comput. 34, 2, 405-432.
39. XU, R. AND WUNSCH, II, D. C. 2005. Survey of clustering algorithms. IEEE Trans. Neural Netw. 16, 3, 645-678.