MACOC: A Medoid-Based ACO Clustering Algorithm

作者: Héctor D. Menéndez , Fernando E. B. Otero , David Camacho

DOI: 10.1007/978-3-319-09952-1_11

关键词:

摘要: The application of ACO-based algorithms in data mining is growing over the last few years and several supervised unsupervised learning have been developed using this bio-inspired approach. Most recent works concerning focused on clustering, showing great potential techniques. This work presents an clustering algorithm inspired by ACO Clustering (ACOC) algorithm. proposed approach restructures ACOC from a centroid-based technique to medoid-based technique, where properties search space are not necessarily known. Instead, it only relies information about distances amongst data. new algorithm, called MACOC, has compared against well-known (K-means Partition Around Medoids) with ACOC. experiments measure accuracy for both synthetic datasets real-world extracted UCI Machine Learning Repository.

参考文章(21)
Matteo Borrotti, Irene Poli, Naïve Bayes Ant Colony Optimization for Experimental Design soft methods in probability and statistics. ,vol. 190, pp. 489- 497 ,(2013) , 10.1007/978-3-642-33042-1_52
Fabrício O de França, Guilherme P Coelho, Fernando J Von Zuben, None, bicACO: An Ant Colony Inspired Biclustering Algorithm ant colony optimization and swarm intelligence. pp. 401- 402 ,(2008) , 10.1007/978-3-540-87527-7_45
Peter Rousseeuw, L Kaufman, Clustering by means of medoids Proc. Statistical Data Analysis Based on the L1 Norm Conference, Neuchatel, 1987. pp. 405- 416 ,(1987)
Satu Elisa Schaeffer, Survey: Graph clustering Computer Science Review. ,vol. 1, pp. 27- 64 ,(2007) , 10.1016/J.COSREV.2007.05.001
Frank Wilcoxon, Individual Comparisons by Ranking Methods Springer Series in Statistics. ,vol. 1, pp. 196- 202 ,(1992) , 10.1007/978-1-4612-4380-9_16
Yucheng Kao, Kevin Cheng, An ACO-Based Clustering Algorithm Ant Colony Optimization and Swarm Intelligence. pp. 340- 347 ,(2006) , 10.1007/11839088_31
Fernando E. B. Otero, Alex A. Freitas, Colin G. Johnson, A New Sequential Covering Strategy for Inducing Classification Rules With Ant Colony Algorithms IEEE Transactions on Evolutionary Computation. ,vol. 17, pp. 64- 76 ,(2013) , 10.1109/TEVC.2012.2185846
GEMA BELLO-ORGAZ, HÉCTOR D. MENÉNDEZ, DAVID CAMACHO, Adaptive k-means algorithm for overlapped graph clustering. International Journal of Neural Systems. ,vol. 22, pp. 1250018- ,(2012) , 10.1142/S0129065712500189
XiaoLi Zhang, XueFeng Chen, ZhengJia He, An ACO-based algorithm for parameter optimization of support vector machines Expert Systems with Applications. ,vol. 37, pp. 6618- 6628 ,(2010) , 10.1016/J.ESWA.2010.03.067
A. P. Dempster, N. M. Laird, D. B. Rubin, Maximum Likelihood from Incomplete Data Via theEMAlgorithm Journal of the Royal Statistical Society: Series B (Methodological). ,vol. 39, pp. 1- 22 ,(1977) , 10.1111/J.2517-6161.1977.TB01600.X