Using ant colony optimization for efficient clustering

被引:0
作者
Yong Wang [1 ]
Wei Zhang [1 ]
Jun Chen [1 ]
Jianfu Li [1 ]
Li Xiao [1 ]
机构
[1] Chongquing Educ Coll, Dept Comp, Chongqing 400067, Peoples R China
来源
ICMIT 2007: MECHATRONICS, MEMS, AND SMART MATERIALS, PTS 1 AND 2 | 2008年 / 6794卷
关键词
ACO; data mining; clustering;
D O I
10.1117/12.784045
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
To improve the performance of data clustering, this study proposes a novel clustering method called ABCA (ACO Based Clustering Algorithm). The presented method is based on heuristic concept and using Ant Colony Optimization algorithm (ACO) to obtain global search. The main advantage of these algorithms lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. Since the proposed method is very efficiently, thus it can perform data clustering very quickly.
引用
收藏
页数:5
相关论文
共 5 条
[1]  
Berkhin P., 2002, SURVEY CLUSTERING DA
[2]  
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[3]   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
[4]  
Dorigo M., 2002, IEEE T EVOLUTIONARY, V6
[5]  
Monmarché N, 1999, LECT NOTES ARTIF INT, V1674, P626