dSimpleGraph: A novel distributed clustering algorithm for exploring very large scale unknown data sets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 162-169

  Lu, Li ^a   Gu, Yunhong ^b   Grossman, Robert ^b  

^a University of Illinois at Chicago   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Distributed clustering algorithm; Equivalence relation; MapReduce

Indexed keywords

CLUSTER-BASED; CLUSTERING APPLICATIONS; DATA SETS; DISTRIBUTED CLUSTERING ALGORITHM; DISTRIBUTED COMPUTING PLATFORM; EQUIVALENCE RELATIONS; EXPERIMENTAL STUDIES; GLOBAL VIEW; MAP-REDUCE; MICRO-CLUSTERS; PRIOR KNOWLEDGE; SCALAR PARAMETERS;

DATA MINING; PARAMETER ESTIMATION; SET THEORY;

CLUSTERING ALGORITHMS;

EID: 79951763568     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2010.12     Document Type: Conference Paper

References (16)

1. C. Aggarwal, J. Han, J. Wang, and P. Yu. A framework for clustering evolving data streams. the 29th VLDB, pages 81- 92.
2. F. Cao, M. Ester, W. Qian, and A. Zhou. Density-based clustering over an evolving data stream with noise. the 6th SIAM SDM, pages 328-339.
3. C. Chu, S. Kim, Y. Lin, Y. Yu, G. Bradski, A. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. NIPS 2006, pages 281-288.
4. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. Operating Systems Design and Implementation, pages 137-149.
5. I. S. Dhillon and D. S. Modha. A data-clustering algorithm on distributed memory mulitprocessors. Lecture Notes in Computer Science, 1759:245-260.
6. G. Forman and B. Zhange. Distributed data clustering can be efficient and exact. ACM SIGKDD explorations newsletter.
7. R. Grossman and Y. Gu. Data mining using high performance data clouds: experimental studies using sector and sphere. the 14th SIGKDD.
8. R. Grossman, M. Sabala, Y. Gu, and etc. Discovering emergent behavior from network packet data: Lessons from the angle project. Next Generation of Data Mining, pages 243-260.
9. http://en.wikipedia.org/wiki/Pcap.
10. http://hadoop.apache.org.
11. E. Januzaj, H.-P. Kriegel, and M. Pfeifle. Dbdc: denstiy-based distributed clustering. Lecture Notes in Computer Science, 2992:529-530.
12. E. Januzaj, H.-P. Kriegel, and M. Pfeifle. Scalable density-based distributed clustering. the 15th European conference on machine learning.
13. E. Johnson and H. Kargupta. Collective, hierarchical clustering from distributed, heterogeneous data. Lecture Notes in Computer Science, 1759:221-244.
14. S. Nassar, J. Sander, and C. Cheng. Incremental and effective data summarization for dynamic hierarchical clustering. ACM SIGMOD 2004.
15. C. F. Olson. Parallel algorithms for hierarchical clustering. Parallel Computing, (21):1313-1325.
16. S. Papadimitriou and J. Sun. Distributed co-clustering with map-reduce: A case study towards petabyte-scale end-to-end mining. ICDM 2008, pages 512-521.