Fast clustering algorithm based on reference and density

Ruan Jian Xue Bao/Journal of Software

Volumn 14, Issue 6, 2003, Pages 1089-1095

  Ma, Shuai ^a   Wang, Teng Jiao ^a   Tang, Shi Wei ^a   Yang, Dong Qing ^a   Gao, Jun ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Clustering; Data mining; Density; High dimension; Reference

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EFFICIENCY; NUMERICAL ANALYSIS;

CLUSTERING ALGORITHMS; DENSITY; HIGH DIMENSIONAL; LINEAR TIME COMPLEXITY; REFERENCE POINTS;

DATA MINING;

EID: 0141791332     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Han JW, Kambr M. Data Mining Concepts and Techniques. Beijing: Higher Education Press, 2001. 145-176.
2. Kaufan L, Rousseeuw PJ. Finding Groups in Data: an Introduction to Cluster Analysis. New York: John Wiley and Sons, 1990.
3. 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 JW, Fayyad UM, eds. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. Portland: AAAI Press, 1996. 226-231.
4. Guha S, Rastogi R, Shim K. CURE: an efficient clustering algorithm for large databases. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 73-84.
5. Agrawal R, Gehrke J, Gunopolos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining application. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 94-105.
6. 2P: clustering based on closest pairs. In: Apers PMG, Atzeni P, Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT, eds. Proceedings of the 27th International Conference on Very Large Data Bases. Roma: Morgan Kaufmann Publishers, 2001. 331-340.
7. Berchtold S, Bohm C, Kriegel H-P. The pyramid-technique: towards breaking the curse of dimensionality. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 142-153.
8. Yu C, Ooi BC, Tan K-L, Jagadish HV. Indexing the distance: an efficient method to KNN processing. In: Apers PMG, Atzeni P, Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT, eds. Proceedings of the 27th International Conference on Very Large Data Bases. Roma: Morgan Kaufmann Publishers, 2001. 421-430.