Data Analysis by Combining the Modified K-Means and Imperialist Competitive Algorithm
DOI:
https://doi.org/10.11113/jt.v70.3515Keywords:
Data analysis, data clustering, k-means clustering, imperialist competitive algorithmAbstract
Data Clustering is one of the most used methods of data mining. The k-means Clustering Approach is one of the main algorithms in the literature of Pattern Recognition and Data Machine Learning which it very popular because of its simple application and high operational speed. But some obstacles such as the adherence of results to initial cluster centers or the risk of getting trapped into local optimality hinders its performance. In this paper, inspired by the Imperialist Competitive Algorithm based on the k-means method, a new approach is developed, in which cluster centers are selected and computed appropriately. The Imperialist Competitive Algorithm (ICA) is a method in the field of evolutionary computations, trying to find the optimum solution for diverse optimization problems. The underlying traits of this algorithm are taken from the evolutionary process of social, economic and political development of countries so that by partly mathematical modeling of this process some operators are obtained in regular algorithmic forms. The investigated results of the suggested  approach over using standard data sets and comparing it with alternative methods in the literature reveals out that the proposed algorithm outperforms the k-means algorithm and other candidate algorithms in the pool. Â
References
Han, J., M. Kamber, and J. Pei. 2006. Data Mining: Concepts and Techniques. Morgan kaufmann.
Gan, G., C. Ma, and J. Wu. 2007. Data Clustering: Theory, Algorithms, and Applications. 20.
Bonab, M. B. 2011. Modified K-Means Algorithm for Genetic Clustering. 11(9): 5.
Bandyopadhyay, S. and U. Maulik. 2002. An Evolutionary Technique based on K-Means Algorithm for Optimal Clustering in RN. Information Sciences. 146(1–4): 221–237.
Kao, Y.-T., E. Zahara, and I.W. Kao. 2008. A Hybridized Approach to Data Clustering. Expert Systems With Applications. 34(3): 1754–1762.
Khan, S. S. and A. Ahmad. 2004. Cluster Center Initialization Algorithm for K-means Clustering. Pattern Recognition Letters. 25(11): 129–1302.
Krishna, K. and M. N. Murty. 1999. Genetic K-means Algorithm. Systems, Man, and Cybernetics, Part B: Cybernetics. IEEE Transactions on. 29(3): 433–439.
Kanungo, T., et al. 2002. An Efficient k-means Clustering Algorithm: Analysis and Implementation. Pattern Analysis and Machine Intelligence. IEEE Transactions on. 24(7): 881–892.
Kuo, R. J., et al. 2005. Application of Ant K-means on Clustering Analysis. Computers & Mathematics with Applications. 50(10–12): 1709–1724.
Sun, L.-X., et al. 1994. Cluster Analysis by the K-means Algorithm and Simulated Annealing. Chemometrics and Intelligent Laboratory Systems. 25(1): 51–60.
Osman, I.H. and N. Christofides. 1994. Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search. International Transactions in Operational Research. 1(3): 317–336.
Güngör, Z. and A. Ünler. 2008. K-Harmonic Means Data Clustering with Tabu-search Method. Applied Mathematical Modelling. 32(6): 1115–1125.
Güngör, Z. and A. Ünler. 2007. K-harmonic Means Data Clustering with Simulated Annealing Heuristic. Applied Mathematics and Computation. 184(2): 199–209.
Alpaydin, E. 2004. Introduction to Machine Learning. MIT press.
Hruschka, E. R. and N. F. Ebecken. 2003. A Genetic Algorithm For Cluster Analysis. Intelligent Data Analysis. 7(1): 15–25.
Atashpaz-Gargari, E. and C. Lucas. 2007. Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic Competition. in Evolutionary Computation, 2007. CEC 2007. IEEE Congress on.
Niknam, T. and B. Amiri. 2010. An Efficient Hybrid Approach Based On PSO, ACO and K-Means for Cluster Analysis. Applied Soft Computing. 10(1): 183–197.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.
