On cluster tree for nested and multi-density data clustering

Pattern Recognition

Volumn 43, Issue 9, 2010, Pages 3130-3143

  Li, Xutao ^a   Ye, Yunming ^a   Li, Mark Junjie ^b   Ng, Michael K ^c  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Cluster tree; Hierarchical clustering; K Means type algorithm; Multi densities

Indexed keywords

DATA MINING; TREES (MATHEMATICS);

CLUSTER TREE; DATA MINING TASKS; HIDDEN INFORMATION; HIER-ARCHICAL CLUSTERING; HIERARCHICAL CLUSTERING APPROACH; K-MEANS; K-MEANS ALGORITHM; SYNTHETIC DATASETS;

CLUSTERING ALGORITHMS;

EID: 78649574534     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2010.03.020     Document Type: Article

References (26)

1. R. Xu, D. Wunsch, Survey of clustering algorithms, IEEE Transaction on Neural Networks 6 (3) (2005) 645-672.
2. L. Ertoz, M. Steinbach, V. Kumar, Finding clusters of different sizes, shapes and densities in noisy, high dimensional data, in: SIAM International Conference on Data Mining, 2003.
3. G. Karypis, J. Han, V. Kumar, CHAMELEON: a hierarchical clustering algorithm using dynamic modeling, IEEE Computer 32 (8) (1999) 68-75.
4. Y. Zhao, S. Mei, X. Fan, S. Junde, Clustering datasets containing clusters of various densities, Journal of Beijing University of Posts and Telecommunications 26 (2) (2003) 42-47.
5. M. Ankerst, M. M. Breuing, H. P. Kriegel, J. Sander, OPTICS: ordering points to identify the clustering structure, in: ACMSIGMOD, 1999, pp. 49-60. (Pubitemid 129597323)
6. S. Zhou, Y. Zhao, J. Guan, Z. Huang, A neighborhood-based clustering algorithm, in: Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer Press, Hanoi, 2005, pp. 361-371.
7. S. Roy, D. K. Bhattacharyya, An approach to find embedded clusters using density based techniques, in: Proceedings of the ICDCIT, Lecture Notes in Computer Science, vol. 3816, 2005, pp. 523-535. (Pubitemid 43846722)
8. L. Duan, L. Xu, F. Guo, J. Lee, B. Yan, A local-density based spatial clustering algorithm with noise, Information Systems 32 (2007) 978-986. (Pubitemid 47017576)
9. S. Gao, Y. Xia, A grid-based density-confidence-interval clustering algorithm for multi-density dataset in large spatial database, in: International Conference on Intelligent Systems Design and Applications, vol. 1, 2006, pp. 713-717.
10. X. Chen, Y. Min, Y. Zhao, P. Wang, GMDBSCAN: multi-density DBSCAN cluster based on grid, in: IEEE International Conference on E-Business Engineering, 2008, pp. 780-783.
11. M. M. Breunig, H.-P. Kriegel, R. T. Ng, J. Sander, LOF: identifying density-based local outliers, in: Proceedings of the ACM SIGMOD 2000 International Conference on Management of Data, 2000, pp. 93-104.
12. M. Li, M. K. Ng, Y. M. Cheung, Z. Huang, Agglomerative fuzzy K-means clustering algorithm with selection of number of clusters, IEEE Transaction on Knowledge and Engineering 20 (11) (2008) 1519-1534.
13. H. Sun, S. Wang, Q. Jiang, FCM-based model selection algorithms for determining the number of clusters, Pattern Recognition 37 (2004) 2027-2037.
14. L. Hubert, P. Arabie, Comparing partitions, Journal of Classification 2 (1985) 193-218.
15. L. M. Collins, C. W. Dent, Omega: a general formulation of the rand index of cluster recovery suitable for non-disjoint solutions, Multivariate Behavioral Research 23 (1988) 231-242.
16. E. Martin, K. Hans-Peter, S. Jorg, X. Xu, A density-based algorithm for discovering clusters in large spatial database with noise, in: International Conference on Knowledge Discovery in Databases and Data Mining, Montreal, Canada, August 1995.
17. D. Pelleg, A. Moore, X-means: extending K-means with efficient estimation of the number of clusters, in: Proceedings of the 17th International Conference on Machine Learning, July 2000.
18. T. Zhang, R. Ramakrishnan, M. Livny, BIRCH: an efficient data clustering method for very large database, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1996, pp. 103-114. (Pubitemid 126440760)
19. S. Guha, R. Rastogi, K. Shim, CURE: an efficient clustering algorithm for large database, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1998, pp. 73-84. (Pubitemid 128655958)
20. T. Martinetz, K. Schulten, A neural-gas network learns topologies, Artificial Neural Network, vol. 1, 1991, pp. 397-402.
21. J. Pakkanen, J. Iivarinen, E. Oja, The evolving tree-a novel self-organizing network for data analysis, Neural Processing Letters 20 (2004) 199-211. (Pubitemid 40003525)
22. C. Bishop, M. Tipping, A hierarchical latent variable model for data visualization, IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (1998) 281-293. (Pubitemid 128741316)
23. T. Su, J. Dy, Automated hierarchical mixtures of probabilistic principal component analyzers, in: Proceedings of the 21st International Conference on Machine Learning, no. 98 Banff, Canada, July 2004.
24. J. Ontrup, H. Ritter, Large scale data exploration with the hierarchical growing hyperbolic SOM, Neural Networks 19 (2006) 751-761. (Pubitemid 44148953)
25. J. Ontrup, H. Ritter, Hyperbolic self-organizing maps for semantic navigation, Advances in Neural Information Processing Systems 14 (2002) 1417-1424.
26. C. Martin, N. Diaz, J. Ontrup, T. Nattkemper, Hyperbolic SOM-based clustering of DNA fragment features for taxonomic visualization and classification, Bioinformatics 24 (2008) 1568-1574. (Pubitemid 351966154)