A robust and efficient clustering algorithm based on cohesion self-merging

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2002, Pages 582-587

  Lin, Cheng Ru ^a   Chen, Ming Syan ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Data clustering; Data mining; Hierarchical clustering; Partitional clustering

Indexed keywords

ALGORITHMS; DECISION SUPPORT SYSTEMS; FUZZY SETS; MERGING; NEURAL NETWORKS; PATTERN RECOGNITION;

COHESION-BASED SELF-MERGING; DATA CLUSTERING; SINGLE-LINK ALGORITHM;

DATA MINING;

EID: 0242540424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775107.775133     Document Type: Conference Paper

References (16)

1. K.S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft When is "nearest neighbor" meaningful? ICDT, pages 217-235, 1999.
2. P. S. Bradley, K. P. Bennett, and A. Demiriz Constrained k-means clustering. MSR-TR-2000-65, Microsoft Research, May 2000.
3. M.-S. Chen, J. Han, and P. S. Yu Data Mining: An Overview from Database Perspective. IEEE Trans. on Knowledge and Data Engineering, 5(1):866-883, December 1996.
4. R. C. Dubes How many clusters are best? - an experiment. Pattern Recognition 20, 6:645-663, 1987.
5. S. Guha, R. Rastogi, and K. Shim CURE: An efficient clustering algorithm for large databases. Proceedings of the ACM SIGMOD Conference on Management of Data, pages 73-84, 1998.
6. S. Guha, R. Rastogi, and K. Shim ROCK: A Robust Clustering Algorithm for Categorical Attributes. Proceedings of the 15th International Conference on Data Engineering, 1999.
7. J. Hertz, A. Krogh, and R. G. Palmer Introduction to the theory of neural computation. Santa Fe Institute Studies in the Sciences of Complexity lecture notes. Addison-Wesley Longman Publ. Co., Inc., Reading, MA, 1991.
8. A. K. Jain, M. N. Murty, and P. J. Flynn Data Clustering: A Review. ACM Computer Surveys, 31(3), Sept. 1999.
9. C.-R. Lin and M.-S. Chen On the optimal clustering of sequential data. Proceedings of the 2nd SIAM International Conference on Data Mining, April 2002.
10. N. M. Murty and G. Krishna A hybrid clustering procedure for concentric and chain-like clusters. International Journal of Computer and Information Sciences, 10(6):397-412, 1981.
11. R. T. Ng and J. Han Efficient and Effective Clustering Methods for Spatial Data Mining. Proceedings of the 20th VLDB Conference, 1994.
12. Y.-J. Oyang, C.-Y. Chen, and T.-W. Yang A study on the hierarchical data clustering algorithm based on gravity theory. Proceedings of 5th European Conference on Principles and Practice of Knowledge Discovery in Databases, pages 350-361, 2001.
13. C. R. Palmer and C. Faloutsos Density biased sampling: An improved method for data mining and clustering. ACM SIGMOD International Conference on Management of Data, pages 89-92, 2000.
14. A. K. H. Tung, J. Han, L. V. S. Lakshmanan, and R. T. Ng Constraint-based clustering in large databases. Proc. 2001 Int. Conf. On Database Theory, Jan 2001.
15. C.-H. Yun, K.-T. Chuang, and M.-S. Chen An efficient clustering algorithm for market basket data based on small-large ratios. Proceedings of the 25th International Computer Software and Applications Conference (COMPSAC 2001), Oct. 2001.
16. T. Zhang, R. Ramakrishnan, and M. Livny BIRCH: An Efficient Data Clustering Method for Very Large Database. Proceedings of the ACM SIGMOD Conference on Management of Data, pages 103-114, 1996.