Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29769


Select areas to restrict search in scientific publication database:
10736
Application of a New Hybrid Optimization Algorithm on Cluster Analysis
Abstract:
Clustering techniques have received attention in many areas including engineering, medicine, biology and data mining. The purpose of clustering is to group together data points, which are close to one another. The K-means algorithm is one of the most widely used techniques for clustering. However, K-means has two shortcomings: dependency on the initial state and convergence to local optima and global solutions of large problems cannot found with reasonable amount of computation effort. In order to overcome local optima problem lots of studies done in clustering. This paper is presented an efficient hybrid evolutionary optimization algorithm based on combining Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), called PSO-ACO, for optimally clustering N object into K clusters. The new PSO-ACO algorithm is tested on several data sets, and its performance is compared with those of ACO, PSO and K-means clustering. The simulation results show that the proposed evolutionary optimization algorithm is robust and suitable for handing data clustering.
Digital Object Identifier (DOI):

References:

[1] Yi-Tung Kao, Erwie Zahara and I-Wei Kao, "A hybridized approach to data clustering" Expert Systems with Applications, Volume 34, Issue 3, pp. 1754-1762, April 2008.
[2] J.F. Lu, J.B. Tang, Z.M. Tang and J.Y. Yang, "Hierarchical initialization approach for K-Means clustering", Pattern Recognition Letters, January 2008.
[3] Hong Zhou and Yonghuai Liu, "Accurate integration of multi-view range images using k-means clustering", Pattern Recognition, Volume 41, Issue 1, pp. 152-175, January 2008.
[4] Michael Laszlo and Sumitra Mukherjee , "A genetic algorithm that exchanges neighboring centers for k-means clustering", Pattern Recognition Letters, Volume 28, Issue 16, pp. 2359-2366, 1 December 2007.
[5] Amir Ahmad and Lipika Dey , "A k-mean clustering algorithm for mixed numeric and categorical data", Data & Knowledge Engineering, Volume 63, Issue 2, pp. 503-527, November 2007.
[6] Chung-Chian Hsu, Chin-Long Chen and Yu-Wei Su , "Hierarchical clustering of mixed data based on distance hierarchy", Information Sciences, Volume 177, Issue 20, 15, pp. 4474-4492, October 2007.
[7] Mohammad Fathian, Babak Amiri and Ali Maroosi , "Application of honey-bee mating optimization algorithm on clustering", Applied Mathematics and Computation, Volume 190, Issue 2, pp. 1502-1513, July 2007.
[8] Stephen J. Redmond and Conor Heneghan , "A method for initialising the K-means clustering algorithm using kd-trees", Pattern Recognition Letters, Volume 28, Issue 8, pp. 965-973, June 2007.
[9] Georgios P. Papamichail and Dimitrios P. Papamichail , "The k-means range algorithm for personalized data clustering in e-commerce", European Journal of Operational Research, Volume 177, Issue 3, pp. 1400-1408, March 2007
[10] R.J. Kuo, H.S. Wang, Tung-Lai Hu and S.H. Chou , "Application of ant K-means on clustering analysis", Computers & Mathematics with Applications, Volume 50, Issues 10-12, pp. 1709-1724, November- December 2005.
[11] P. S. Shelokar, V. K. Jayaraman and B. D. Kulkarni ",An ant colony approach for clustering ",Analytica Chimica Acta, Volume 509, Issue 2, pp. 187-195, May 2004.
[12] Michael K. Ng and Joyce C. Wong , "Clustering categorical data sets using tabu search techniques", Pattern Recognition, Volume 35, Issue 12, December 2002, pp. 2783-2790
[13] C. S. Sung and H. W. Jin, "A tabu-search-based heuristic for clustering", Pattern Recognition, Volume 33, Issue 5, pp. 849-858, May 2000.
[14] Khaled S. Al-Sultan, "A Tabu search approach to the clustering problem", Pattern Recognition, Volume 28, Issue 9, pp. 1443- 1451, September 1995.
[15] Michael Laszlo and Sumitra Mukherjee, "A genetic algorithm that exchanges neighboring centers for k-means clustering" Pattern Recognition Letters, Volume 28, Issue 16, pp. 2359-2366, December 2007
[16] J. Olamaei , T. Niknam and G. Gharehpetian, "Application of Particle Swarm Optimization for Distribution Feeder Reconfiguration Considering Distributed Generators", accepted for future publication in Applied Mathematics and Computation journal, 2008.
[17] J. Kennedy and R. Eberhart, "Particle Swarm Optimization," IEEE International Conf. on Neural Networks, Piscataway, NJ, vol. 4, pp. 1942- 1948, 1995.
[18] T. Niknam, "An Approach Based on Particle Swarm Optimization for Optimal Operation of Distribution Network Considering Distributed Generators,", 32nd Annual Conference onIEEE Industrial Electronics, IECON 2006 , pp. :633 - 637
[19] T. Niknam , A.M. Ranjbar and A.R. Shirani, "A new approach for distribution state estimation based on ant colony algorithm with regard to distributed generation" Journal of Intelligent and Fuzzy Systems, vol. 16, no. 2, pp.119-131, June 2005.
[20] T.Niknam, H. Arabian and M. Mirjafari, "Reactive power pricing in deregulated environments using novel search methods" Proceedings of 2004 International Conference on Machine Learning and Cybernetics, 2004, vol. 7, p.p. 4234 - 4239, Aug. 2004
[21] T. Niknam, A.M. Ranjbar, and A.R. Shirani, "A new approach based on ant algorithm for Volt/Var control in distribution network considering distributed generation," Iranian Journal of Science & Technology, Transaction B, vol. 29, no. B4, pp. 1-15, 2005.
[22] M. Dorigo, G.D. Caro and L.M. Gambardella, "Ants algorithms for discrete optimization", Artificial Life, vol. 5, no. 3, pp. 137-172, 1999.
Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007