Clustering very large multi-dimensional datasets with MapReduce

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

Volumn , Issue , 2011, Pages 690-698

  Cordeiro, Robson L F ^a   Traina, Caetano ^a   Traina, Agma J M ^a   López, Julio ^b   Kang, U ^b   Faloutsos, Christos ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algorithms; Design; Experimentation; Performance

Indexed keywords

CLUSTERING ALGORITHMS; COST FUNCTIONS; COSTS;

CLUSTERINGS; COST-FUNCTION; DATA PARTITION; EXPERIMENTATION; HIGH-DIMENSIONALITY DATASETS; MAP-REDUCE; MULTI-DIMENSIONAL DATASETS; NETWORK COSTS; PERFORMANCE; PROCESSING NODES;

MAPREDUCE;

EID: 80052686089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020516     Document Type: Conference Paper

References (19)

1. E. Achtert, C. Böhm, H.-P. Kriegel, P. Kröger, and A. Zimek. Robust, complete, and efficient correlation clustering. In SDM, USA, 2007.
2. P. K. Agarwal and N. H. Mustafa. k-means projective clustering. In PODS, pages 155-165, Paris, France, 2004. ACM.
3. C. Aggarwal and P. Yu. Redefining clustering for high-dimensional applications. IEEE TKDE, 14(2):210-225, 2002.
4. C. C. Aggarwal, J. L. Wolf, P. S. Yu, C. Procopiuc, and J. S. Park. Fast algorithms for projected clustering. SIGMOD Rec., 28(2):61-72, 1999. (Pubitemid 129597324)
5. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. SIGMOD Rec., 27(2):94-105, 1998. (Pubitemid 128655960)
6. C. Böhm, K. Kailing, P. Kröger, and A. Zimek. Computing clusters of correlation connected objects. In SIGMOD, pages 455-466, NY, USA, 2004.
7. H. Cheng, K. A. Hua, and K. Vu. Constrained locally weighted clustering. PVLDB, 1(1):90-101, 2008.
8. R. L. F. Cordeiro, A. J. M. Traina, C. Faloutsos, and C. Traina Jr. Finding clusters in subspaces of very large, multi-dimensional datasets. In ICDE, pages 625-636, 2010.
9. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI, 2004.
10. U. Fayyad. A data miner's story - getting to know the grand challenges. In Invited Innovation Talk, KDD, 2007: Slide 61. Available at: http://videolectures.net/kdd07-fayyad-dms/.
11. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations. SDM, 2010.
12. U. Kang, C. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system - implementation and observations. ICDM, 2009.
13. H.-P. Kriegel, P. Kröger, M. Renz, and S. Wurst. A generic framework for efficient subspace clustering of high-dimensional data. In ICDM, pages 250-257, USA, 2005. (Pubitemid 47385700)
14. H.-P.Kriegel, P. Kröger, and A. Zimek. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM TKDD, 3(1):1-58, 2009.
15. R. Lämmel. Google's mapreduce programming model - revisited. Science of Computer Programming, 70:1-30, 2008.
16. G. Moise and J. Sander. Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In KDD, pages 533-541, 2008.
17. G. Moise, J. Sander, and M. Ester. Robust projected clustering. Knowl. Inf. Syst., 14(3):273-298, 2008.
18. A. K. H. Tung, X. Xu, and B. C. Ooi. Curler: finding and visualizing nonlinear correlation clusters. In SIGMOD, pages 467-478, New York, NY, USA, 2005. (Pubitemid 43038950)
19. M. L. Yiu and N. Mamoulis. Iterative projected clustering by subspace mining. IEEE TKDE, 17(2):176-189, Feb. 2005. (Pubitemid 40320177)