Application of ant K-means on clustering analysis

被引:92
作者
Kuo, RJ [1 ]
Wang, HS [1 ]
Hu, TL [1 ]
Chou, SH [1 ]
机构
[1] Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei 106, Taiwan
关键词
data mining; clustering analysis; ant colony optimization;
D O I
10.1016/j.camwa.2005.05.009
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper intends to propose a novel clustering method, ant K-means (AK) algorithm. AK algorithm modifies the K-means as locating the objects in a cluster with the probability, which is updated by the pheromone, while the rule of updating pheromone is according to total within cluster variance (TWCV). The computational results showed that it is better than the other two methods, self-organizing feature map (SOM) followed by K-means method and SOM followed by genetic K-means algorithm via 243 data sets generated by Monte Carlo simulation. To further testify this novel method, the questionnaire survey data for the plasma television market segmentation is employed. The results also indicated that the proposed method is the best among these three methods based on TWCV. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1709 / 1724
页数:16
相关论文
共 27 条
[1]  
[Anonymous], ACM COMPUTING SURVEY
[2]  
Berkhin P., SURVEY CLUSTERING DA
[3]   ART-2 - SELF-ORGANIZATION OF STABLE CATEGORY RECOGNITION CODES FOR ANALOG INPUT PATTERNS [J].
CARPENTER, GA ;
GROSSBERG, S .
APPLIED OPTICS, 1987, 26 (23) :4919-4930
[4]  
Corne David., 1999, NEW IDEAS OPTIMIZATI
[5]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[6]  
Dorigo M., 2000, IRIDIA200032
[7]  
FAYYAD U, 1997, SCI STAT DATABASE MA
[8]   Methodological and practical aspects of data mining [J].
Feelders, A ;
Daniels, H ;
Holsheimer, M .
INFORMATION & MANAGEMENT, 2000, 37 (05) :271-281
[9]  
Freeman J., 1992, NEURAL NETWORKS ALGO
[10]  
KOHONEN T, 1991, ARTIFICIAL NEURAL NETWORKS, VOLS 1 AND 2, P981