Clustering with K-Means Hybridization Ant Colony Optimization (K-ACO)

Subject Areas : International Journal of Mathematical Modelling & Computations

Dewi Ratnaningsih ¹

1 - Jl. Cabe Raya Pondok Cabe Pamulang

Received: 2022-02-28 Accepted : 2022-05-26 Published : 2022-06-30

Keywords: Data mining, Clustering, Ant colony optimization, K-means, program R, Iris data,

Abstract :

One of well-known techniques in data mining is clustering. Clustering method which is very popular is K-means cluster because its algorithm is very easy and simple. However, K-means cluster has some weaknesses, one of which is that the cluster result is sensitive towards centroid initialization so that the cluster result tends to local optimal. This paper explains the modification of K-means cluster, that is, K-means hybridization with ant colony optimization (K-ACO). Ant Colony Optimization (ACO) is optimization algorithm based on ant colony behavior. Through K-ACO, the weaknesses of cluster result which tends to local optimal can be overcome well. The application of hybrid method of K-ACO with the use of R program gives better accuracy compared to K-means cluster. K-means cluster accuracy yielded by Minitab, Mathlab, and SAS at iris data is 89%. Meanwhile, K-ACO hybrid clustering with R program simulated on 38 treatments with 3-time repetitions gives accuracy result of 93,10%.

References:

[1] M. Dorigo, V. Maniezzo and A. Coloni, The ant system: optimization by a colony of cooperating agents, IEEE Trans Syst Man, Cybernetics- Part B, 26 (1) (1996) 29-41, doi:10.1109/3477.484436.
[2] M. Dorigo and L. M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transaction on Evolutionary Computation, 1 (1) (1997) 53-66,
doi:10.1016/j.eswa.2008.01.066.
[3] M. Dorigo and T. Stutzle, Ant Colony Optimization. A Bradford Book. London: The MIT Press Cambridge, 1(4) (2004) 28-39, doi:10.1109/MCI.2006.329691.
[4] X. Liu, Ant colony optimization based on dynamical pheromones for clustering analysis. International Journal of Hybrid Information Technology. 7 (2) (2014) 29-38, doi:10.14257/ijhit.2014.7.2.04.
[5] A. Mohan, G. Remya, A parallel implementation of ant colony optimization for TSP based on MapReduce
framework. International Journal of Computer Applications. 88 (8) (2014) 9-12.
[6] MA. Muñoz, JA. Lopez, EF. Caicedo, Swarm intelligence: problem-solving societies (a review), 28 (2)
(2008) 119-130.
[7] K. Shyamala, SS. Prabha, An ant colony optimization approach to solve traveling salesman problem.
International Journal on Recent and Innovation Trends in Computing and Communication. 2 (12) (2014)
3966–3971.
[8] W. N. Tanjung, Implementasi Algoritma K-Ant Colony Optimization untuk menyelesaikan masalah
alokasi-alokasi. Tesis, Universitas Indonesia (2012).
[9] A. Verma, A. Kumar. Performance enhancement of K-means clustering algorithms for high dimensional data sets. International Journal of Advanced Research in Computer Science and Software Engineering. 4 (1)(2014) 791-796.
[10] IMK. Wicaksana, IM. Widiartha, Metode ant colony optimization pada metode K-harmonic means untuk klasterisasi data. Jurnal Ilmu Komputer. 5 (1) (2012) 55-62.