Cluster cores-based clustering for high dimensional data

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 519-522

  Shen, Yi Dong ^a   Shen, Zhi Yong ^a   Zhang, Shi Ming ^a   Yang, Qiang ^b  

^a INSTITUTE OF SOFTWARE   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPH THEORY; LEARNING SYSTEMS; NUMERICAL ANALYSIS; SEMANTICS; SET THEORY;

CLUSTERING; CORES; EDGE CONNECTIVITY; JARVIS-PATRICK METHOD;

DATA REDUCTION;

EID: 19544391805     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. L. Ertoz, M. Steinbach and V. Kumar, Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data, in: Proc. 3rd SIAM International Conference on Data Mining San Francisco, CA, USA, 2003
2. S. Guha, R. Rastogi and K. Shim, ROCK: A robust clustering algorithm for categorical attributes, in: Proc. IEEE Intl. Conf. on Data Engineering, pp. 512-521, 1999.
3. E. Hartuv and R. Shamir, A clustering algorithm based on graph connectivity, Information Processing Letters 76:175-181 (2000).
4. R. A. Jarvis and E. A. Patrick, Clustering using a similarity measure based on shared nearest neighbors, IEEE Transactions on Computers C-22(11): 264-323 (1973).