Local density based distributed clustering algorithm

Ruan Jian Xue Bao/Journal of Software

Volumn 19, Issue 9, 2008, Pages 2339-2348

  Ni, Wei Wei ^a   Chen, Geng ^b   Wu, Ying Jie ^a   Sun, Zhi Hui ^a  

^a SOUTHEAST UNIVERSITY   (China)

^b NANJING AUDIT UNIVERSITY   (China)

Author keywords

Density attractor; Distributed clustering; High dimension data; Local clustering model; Local density based clustering

Indexed keywords

CLUSTER ANALYSIS; ELECTRIC NETWORK ANALYSIS; FLOW OF SOLIDS;

CLUSTERING DATA; CLUSTERING QUALITY; DATA-SETS; DENSITY ATTRACTOR; DENSITY BASED; DISTRIBUTED CLUSTERING; DISTRIBUTED CLUSTERING ALGORITHMS; HIGH DIMENSION DATA; HIGH DIMENSIONS; LOCAL CLUSTERING MODEL; LOCAL DENSITY BASED CLUSTERING; LOCAL-DENSITY; THEORETICAL ANALYSIS;

CLUSTERING ALGORITHMS;

EID: 52349117708     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1001.2008.02339     Document Type: Article

References (8)

1. Inderjit S. Dhillon, Dharmendra S. Modha. A data-clustering algorithm on distributed memory multiprocessors. In: Proc. of the Int'l Conf. on Knowledge Discovery and Data Mining (SIGKDD'99). 1999. 245-260. http://www.cs.rpi.edu/-zaki/WKDD99/dhillon.ps.gz
2. Nagesh HS, Goil S, Choudhary A. A scalable parallel subspace clustering algorithm for massive data sets. In: Proc. of the 2000 Int'l Conf. on Parallel. 2000. 477-484. http://citeseer.ist.psu.edu/377365.html
3. Januzaj E, Kriege HP, Pfeifle M. Towards effect and efficient distributed clustering. In: Proc. of the 3th IEEE Int'l Conf. on Data Mining. 2003. http://citeseer.ist.psu.edu/januzaj03towards.html
4. Beyer K, Goldstein J, Ramakrishnan R. When is 'Nearest Neighbor' Meaningful?. In: Beeri C, Buneman P, eds. In: Proc. of the 7th Int'l Conf. on Database Theory (ICDT'99). 1999. 217-235. http://citeseer.ist.psu.edu/605885.html
5. Ester M, Kriegel HP, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad UM, eds. Proc. of the 2nd Int'l Conf. on Knowledge Discovery and Data Mining. Oregon: AAAI Press, 1996. 226-231.
6. Ni WW, Sun ZH, Lu JP. K-LDCHD: A local density based k-neighborhood clustering algorithm for high dime nsional space. Journal of Computer Research and Development, 2005, 42(5): 784-791 (in Chinese with English abstract).
7. Januzaj E, Kriege HP, Pfeifle M. Scalable density-based distributed clustering. In: Proc. of the 8th European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD), Knowledge Discovery in Databases: PKDD 2004. Berlin: Springer-Verlag, 2004. 231-244. http://www.sse-tubs.de/publications/Januzaj_et_al_PKDD_04.pdf
8. Halkidi M, Vazirgiannis M. Clustering validity assessment: Finding the optimal partitioning of a data set. In: Proc. of the 1st IEEE Int'l Conf. on Data Mining. 187-194. http://citeseer.ist.psu.edu/519636.html