A new fast clustering algorithm based on reference and density

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2762, Issue , 2003, Pages 214-225

  Ma, Shuai ^a   Wang, TengJiao ^a   Tang, ShiWei ^a   Yang, DongQing ^a   Gao, Jun ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; DATA MINING; INFORMATION MANAGEMENT; TREES (MATHEMATICS);

CLUSTERING ANALYSIS; DATA MINING ALGORITHM; DBSCAN ALGORITHM; DENSITY-BASED CLUSTERING; LINEAR TIME COMPLEXITY; MEANS CLUSTERING; THEORETIC ANALYSIS; VERY LARGE DATABASE;

CLUSTERING ALGORITHMS;

EID: 35248883970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45160-0_21     Document Type: Article

References (14)

1. Jiawei Han, Micheline Kambr. Data mining concepts and techniques, Morgan Kaufmann Publisher (2000) 145-176.
2. Anderberg, M. R. Cluster analysis for applications, Academic Press (1973).
3. M. Ester, H. P. Kriegel, J. Sander, and X. Xu. A density based algorithm for discovering clusters in large spatial databases with noise. Proceedings of International Conference on Knowledge Discovery and Data Mining (1996).
4. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. Proceedings of ACM SIGMOD International Conference on Management of Data, Montreal, Canada (1996) 103-114.
5. S. Guha, R. Rastogi and K. Shim. CURE: An efficient clustering algorithm for large databases. Proceedings of ACM SIGMOD International Conference on Management of Data, New York (1998) 73-84.
6. R. Aggrawal, J. Gehrke, D. Gunopulos, P. Raghavan. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications, Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle, Washington (1998) 94-105.
7. Goil, Saniay, Harasha Nagesh and Alok Choundhary. MAFIA: Efficient and scalable Subspace Clustering for Very Large Data Sets. Technical Report Number CPDC-TR-9906-019, Center for Parallel and Distributed Computing, Northwestern University (1999).
8. Hinneburg, Alexander and Daniel A.Keim. Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering. Proceedings of the 25th VLDB Conference, Edinburgh, Scotland (1999).
9. Guha, S., Rastogi. R. and Shim K. Rock: A Robust Clustering Algorithm for Categorical Attributes, Proceedings of the International Conference on Data Engineering, Sydney, Australia (1999) 512-521.
10. Karypis George, Eui-Hong Han, and Vipin Kumar. CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE Computer (1999) 68-75.
11. Estivill-Castro, Vladimir and Ickjai Lee. AMOEBA: Hierarchical Clustering Based on Spatial Proximity Using Delaunay Diagram. Proceedings of the 9th International Symposium on Spatial Data Handling. Beijing, China (2000).
12. Alexandros Nanopoulos, Yannis Theodoridis, Yannis Manolopoulos. C2P: Clustering based on Closest Pairs. Proceedings of the 27th VLDB Conference, Roma, Italy (2001).
13. S. Berchtold, C. Bohm, and H-P. Kriegel. The pyramid-technique: Towards breaking the curse of dimensionality. Proceedings of ACM SIGMOD International Conference on Management of Data (1998) 142-53.
14. C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the Distance: An Efficient Method to KNN Processing. Proceedings of 27th VLDB Conference, Roma, Italy (2001).