Fast clustering using MapReduce

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 681-689

  Ene, Alina ^a   Im, Sungjin ^a   Moseley, Benjamin ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Approximation algorithms; Clustering algorithms; K center; K median; MapReduce; Parallel algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; PARALLEL ALGORITHMS;

ALGORITHM SOLUTION; CLUSTERING PROBLEMS; CLUSTERINGS; CONSTANT FACTOR APPROXIMATION; DATA SET; K-CENTER; K-MEDIAN; LARGE DATASETS; MAP-REDUCE; PROGRAMMING ENVIRONMENT;

MAPREDUCE;

EID: 80052666000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020515     Document Type: Conference Paper

References (33)

1. Google: Cluster computing and mapreduce. http://code.google.com/edu/ submissions/mapreduceminilecture/listing.html.
2. P. K. Agarwal and N. H. Mustafa. k-means projective clustering. In PODS, pages 155-165, 2004.
3. D. Arthur and S. Vassilvitskii. k-means++: the advantages of careful seeding. In SODA, pages 1027-1035, 2007.
4. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAM J. Comput., 33(3):544-562, 2004.
5. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In FOCS, pages 184-193, 1996.
6. Y. Bartal. On approximating arbitrary metrices by tree metrics. In STOC, pages 161-168, 1998.
7. M. Berry. Mapreduce and k-means clustering. http://blog.data-miners.com/ 2008/02/mapreduce-and-kmeans-clustering.html, 2008.
8. G. E. Blelloch and K. Tangwongsan. Parallel approximation algorithms for facility-location problems. In SPAA, pages 315-324, 2010.
9. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. SIAM J. Comput., 33(6):1417-1440, 2004. (Pubitemid 40026770)
10. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: Deterministic approximation algorithms for group steiner trees and k-median. In STOC, pages 114-123, 1998.
11. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In FOCS, pages 378-388, 1999. (Pubitemid 129306191)
12. M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci., 65(1):129-149, 2002.
13. K. Chen. On k-median clustering in high dimensions. In SODA, pages 1177-1185, 2006. (Pubitemid 43275345)
14. K. Chen. A constant factor approximation algorithm for k-median clustering with outliers. In SODA, pages 826-835, 2008.
15. F. Chierichetti, R. Kumar, and A. Tomkins. Max-cover in map-reduce. In WWW, pages 231-240, 2010.
16. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proceedings of OSDI, pages 137-150, 2004.
17. M. E. Dyer and A. M. Frieze. A simple heuristic for the p-centre problem. Operations Research Letters, 3(6):285 - 288, 1985.
18. J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina. On distributing symmetric streaming computations. ACM Transactions on Algorithms, 6(4), 2010.
19. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293 - 306, 1985.
20. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams: Theory and practice. IEEE Trans. Knowl. Data Eng., 15(3):515-528, 2003.
21. A. Gupta and K. Tangwongsan. Simpler analyses of local search algorithms for facility location. CoRR, abs/0809.2554, 2008.
22. R. Herwig, A. J. Poustka, C. Müller, C. Bull, H. Lehrach, and J. O'Brien. Large-Scale Clustering of cDNA-Fingerprinting Data. Genome Research, 9(11):1093-1105, November 1999.
23. D. S. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10(2):180-184, May 1985.
24. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In STOC, pages 731-740. ACM, 2002. (Pubitemid 35009436)
25. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. Hadi: Fast diameter estimation and mining in massive graphs with hadoop. Technical report, School of Computer Science, Carnegie Mellon University Pittsburgh, December 2008.
26. H. J. Karloff, S. Suri, and S. Vassilvitskii. A model of computation for mapreduce. In SODA, pages 938-948, 2010.
27. J. Lin and C. Dyer. Data-Intensive Text Processing with MapReduce. Synthesis Lectures on Human Language Technologies. Morgan & Claypool Publishers, 2010.
28. S. P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-136, 1982.
29. A. Ma and I. K. Sethi. Distributed k-median clustering with application to image clustering. In PRIS, pages 215-220, 2007.
30. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD Conference, pages 135-146, 2010.
31. R. M. McCutchen and S. Khuller. Streaming algorithms for k-center clustering with outliers and with anonymity. In APPROX-RANDOM, pages 165-178, 2008.
32. M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. SIAM J. Comput., 34(2):405-432, 2004.
33. T. White. Hadoop: The Definitive Guide. O'Reilly Media, 2009.