Abstract.
Clustering is a process for partitioning datasets. This technique is very useful for optimum solution. k-means is one of the simplest and the most famous methods that is based on square error criterion. This algorithm depends on initial states and converges to local optima. Some recent researches show that k-means algorithm has been successfully applied to combinatorial optimization problems for clustering. In this paper, we purpose a novel algorithm that is based on combining two algorithms of clustering; k-means and Modify Imperialist Competitive Algorithm. It is named hybrid K-MICA. In addition, we use a method called modified expectation maximization (EM) to determine number of clusters. The experimented results show that the new method carries out better results than the ACO, PSO, Simulated Annealing (SA), Genetic Algorithm (GA), Tabu Search (TS), Honey Bee Mating Optimization (HBMO) and k-means.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson E 1935 The irises of the Gaspe Peninsula. Bulletin of the American Iris Society 59: 2–5
Atashpaz-Gargari E, Lucas C 2007a Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation 4661–4667
Atashpaz-Gargari E, Lucas C 2007b Designing an optimal PID controller using Colonial Competitive Algorithm, First Iranian Joint Congress on Fuzzy and Intelligent Systems. Mashhad. Iran
Atashpaz-Gargari E, Hashemzadeh F, Lucas C 2008a Designing MIMO PID controller using colonial competitive algorithm. Proceeding of IEEE CEC 2008, within IEEE WCCI 2008 1929–1934
Atashpaz-Gargari E, Hashemzadeh F, Rajabioun R, Lucas C 2008b Colonial competitive algorithm: a novel approach for PID controller design in MIMO distillation column process. Int. J. Intelligent Computing and Cybernetics (IJICC) 1(3): 337–355
Bahmani Firouzi B, Sha Sadeghi M, Niknam T 2010 A new hybrid algorithm based on PSO, SA, and k-means for cluster analysis. Int. J. Innovative Computing Information and Control. 6(4): 1–10
Cao D N, Krzysztof J Cios 2008 GAKREM: a novel hybrid clustering algorithm. Information Sciences 178: 4205–4227
Fathian M, B Amiri, Maroosi Ali 2008 A honey-bee mating approach on clustering. The International Journal of Advanced Manufacturing Technology 43(9–10): 809–821
Figueiredo M A T, Jain A K 2002 Unsupervised learning of finite mixture models. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(3): 381–396
Fisher R A 1936 The use of multiple measurements in taxonomic problems. Annals of Eugenics 7: 179–188
Huan Min Xu, Dong Bo Li 2008 A clustering-based modeling scheme of the manufacturing resources for process planning. The International Journal of Advanced Manufacturing Technology 38(1–2): 154–162
Jasour A M, Atashpaz Gargari E, Lucas C 2008 Vehicle Fuzzy Controller Design Using Imperialist Competitive Algorithm. Second Iranian Joint Congress on Fuzzy and Intelligent Systems. Tehran, Iran.
Kao Y T, Zahar E, I. Kao W 2008 A hybridized approach to data clustering. Expert Systems with Applications 34(3): 1754–1762
Krishna K, Murty M 1999 Genetic k-means algorithm. IEEE Transactions on Systems. Man and Cybernet, Part B: Cybernet 29: 433–439
Laszlo M, Mukherjee S 2007 A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recognition Letters 28(16): 2359–2366
Lloyd 1979 Least square quantization in PCM. IEEE Transactions on Information Theory 28(2): 129–137
MacQueen J B 1967 Some Methods for classification and Analysis of Multivariate Observations. Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability 281–297
Morales A K, Erazo F R 2009 A search space reduction methodology for data mining in large data bases. Engineering Application of Artificial Intelligence 22(1): 92–100
Mualik U, Bandyopadhyay S 2000 Genetic algorithm-based clustering technique. Journal of Pattern Recognition Letters 33: 1455–1465
Ng M K, Wong J C 2002 Clustering categorical data sets using tabu search techniques. Journal of Pattern Recognition Letters 35(12): 2783–2790
Niknam T, Olamaie J, Amiri B 2008a A hybrid evolutionary algorithm based on ACO and SA for cluster analysis. Journal of Applied Science 8(15): 2695–2702
Niknam T, Bahmani Firouzi B, Nayeripour M 2008b An efficient hybrid evolutionary algorithm for cluster analysis. World Applied Sciences Journal 4(2): 300–307
Niknam T, Amiri B, Olamaie J, Arefi A 2009 An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering. Journal of Zhejiang University of Science A 10(4):512–519
Niknam T, Amiri B 2010 An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Journal of Applied Soft Computing 10(1): 183–197
Rajabioun R, Hashemzadeh F, Atashpaz-Gargari E 2008a Colonial competitive algorithm: a novel approach for PID controller design in MIMO distillation column process. Int. J. Intelligent Computing and Cybernetics 1(3): 337–355
Rajabioun R, Hashemzadeh F, Atashpaz-Gargari E, Mesgari B, Rajaiee Salmasi F 2008b Identification of a MIMO evaporator and Its decentralized PID controller tuning using colonial competitive algorithm. The International Federation of Automatic Control Congress. Seoul Korea:9952–9957
Roshanaei M, Atashpaz-Gargari E, Lucas C 2008 Adaptive beamforming using colonial competitive algorithm. 2nd International Joint Conference on Computational Engineering. Vancouver. Canada.
Safarinejadian B, Menhaj Mohammad B, Karrari Mehdi 2010 Distributed unsupervised gaussian mixture learning for density estimation in sensor networks. IEEE Transactions on Instrumentation and Measurement 59(9): 2250–2260
Shelokar P S, Jayaraman V K, Kulkarni B D 2004 An ant colony approach for clustering. Analytica Chimica Acta 509(2): 187–195
Sung C S, Jin H W 2000 A tabu-search-based heuristic for clustering. Pattern Recognition Letters 33(5): 849–858
Tibshirani R, Walther G, Hastie T 2001 Estimating the number of clusters in a data set via the gap statistic. J. Statistical Soc., Series B 63(2):411–423
Zalik K R 2008 An efficient k-means clustering algorithm. Pattern Recognition Letters 29: 1385–1391
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
NIKNAM, T., FARD, E.T., EHRAMPOOSH, S. et al. A new hybrid imperialist competitive algorithm on data clustering. Sadhana 36, 293–315 (2011). https://doi.org/10.1007/s12046-011-0026-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12046-011-0026-4