Clustering is a process to discover unseen patterns in a given set of objects. Objects belonging to the same pattern are homogenous in nature while they are heterogeneous in other patterns. In this paper, a hybrid data clustering algorithm comprising of improved cat swarm optimization (CSO) and K-harmonic means (KHM) is proposed to solve the clustering problem. The proposed algorithm exhibits strengths of both the mentioned algorithms, it is named as improved CSOKHM (ICSOKHM). The performance of the proposed algorithm is evaluated using seven datasets and is compared with existing algorithms like KHM, PSO, PSOKHM, ACA, ACAKHM, GSAKHM and CSO. The experimental results demonstrate that the proposed algorithm not only improves the convergence speed of CSO algorithm but also prevents KHM algorithm from running into local optima.
C.Y.Chen and F.Ye, Particle swarm optimization algorithm and its application to clustering analysis, in: IEEE International Conference on Networking, Sensing and Control, Vol. 2, 2004, pp. 789–794.
2.
S.C.Chu, P.W.Tsai and J.S.Pan, Cat swarm optimization, in: PRICAI 2006: Trends in Artificial Intelligence, Springer, Berlin, Heidelberg, 2006, pp. 854–858.
3.
A.Dalli, Adaptation of the F-measure to cluster based lexicon quality evaluation, in: Proceedings of the European Association for Computational Linguistics, 2003, pp. 51–56.
4.
M.R.Garey, D.Johnson and H.Witsenhausen, The complexity of the generalized Lloyd–Max problem, IEEE Transactions on Information Theory28(2) (1982), 255–256.
5.
J.Handl, J.Knowles and M.Dorigo, On the performance of ant-based clustering, in: Design and Application of Hybrid Intelligent Systems. Frontiers in Artificial Intelligence and Applications, Vol. 104, 2003, pp. 204–213.
6.
A.Hatamlou, Black hole: A new heuristic optimization approach for data clustering, Information Sciences222 (2013), 175–184.
7.
A.K.Jain, Data clustering: 50 years beyond K-means, Pattern Recognition Letters31(8) (2010), 651–666.
8.
H.Jiang, S.Yi, J.Li, F.Yang and X.Hu, Ant clustering algorithm with K-harmonic means clustering, Expert Systems with Applications37(12) (2010), 8679–8684.
9.
D.Karaboga and B.Basturk, A powerful and efficient algorithm for numerical function optimization: Artificial Bee Colony (ABC) algorithm, Journal Global Optimization39(3) (2007), 459–471.
10.
D.Karaboga and C.Ozturk, A novel clustering approach: Artificial Bee Colony (ABC) algorithm, Applied Soft Computing11 (2011), 652–657.
11.
Y.Kumar and G.Sahoo, A charged system search approach for data clustering, Progress in Artificial Intelligence2(2,3) (2014), 153–166.
12.
Y.Kumar and G.Sahoo, A chaotic charged system search approach for data clustering, Informatica38(3) (2014), 149–161.
13.
Y.Kumar and G.Sahoo, A hybridize approach for data clustering based on cat swarm optimization, International Journal of Information and Communication Technology (2014), to appear.
14.
Y.Kumar and G.Sahoo, An improved cat swarm optimization algorithm for clustering, in: Computational Intelligence in Data Mining, Vol. 1, 2015, pp. 187–197.
15.
J.MacQueen, Some algorithms for classification and analysis of multivariate observations, in: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, 1967, pp. 281–297.
16.
R.J.Mullen, D.Monekosso, B.Sarah and R.Paolo, A review of ant algorithms, Expert Systems with Applications36(6) (2009), 9608–9617.
17.
C.A.Murthy and N.Chowdhury, In search of optimal clusters using genetic algorithms, Pattern Recognition Letters17(8) (1996), 825–832.
18.
A.Nickabadi, M.M.Ebadzadeh and R.Safabakhsh, A novel particle swarm optimization algorithm with adaptive inertia weight, Applied Soft Computing11(4) (2011), 3658–3670.
19.
G.Panda, P.M.Pradhan and B.Majhi, IIR system identification using cat swarm optimization, Expert Systems with Applications38(10) (2011), 12671–12683.
20.
J.M.Pena, J.A.Lozano and P.Larranaga, An empirical comparison of four initialization algorithms for the K-means algorithm, Pattern Recognition Letters20(10) (1999), 1027–1040.
21.
P.M.Pradhan and G.Panda, Solving multi objective problems using cat swarm optimization, Expert Systems with Applications39(3) (2012), 2956–2964.
22.
S.Rana, S.Jasola and R.Kumar, A review on particle swarm optimization algorithms and their applications to data clustering, Artificial Intelligence Review35(3) (2011), 211–222.
23.
E.Rashedi, H.Nezamabadi-pour and S.Saryazdi, GSA: A gravitational search algorithm, Information Sciences179(13) (2009), 2232–2248.
24.
A.J.Sahoo and Y.Kumar, Modified teacher learning based optimization algorithm for data clustering, in: Advances in Signal Processing and Intelligent Recognition Systems, Springer, 2014, pp. 429–437.
25.
B.Santosa and K.N.Mirsa, Cat swarm optimization for clustering, in: International Conference on Soft Computing and Pattern Recognition (SOCPAR’09), 2009, pp. 54–59.
26.
S.Sarafrazi, H.Nezamabadi-pour and S.Saryazdi, Disruption: A new operator in gravitational search algorithm, Scientia Iranica D18(3) (2011), 539–548.
27.
S.C.Satapathy and A.Naik, Data clustering based on teaching–learning-based optimization, in: Swarm, Evolutionary, and Memetic Computing, Springer, Berlin, Heidelberg, 2011, pp. 148–156.
28.
P.S.Shelokar, V.K.Jayaraman and B.D.Kulkarni, An ant colony approach for clustering, Analytica Chimica Acta509(2) (2004), 187–195.
29.
Y.Shi and R.Eberhart, Fuzzy adaptive particle swarm optimization, in: Congress on Evolutionary Computation, Seoul, Korea, 2001.
30.
P.W.Tsai, J.S.Pan, S.M.Chen and B.Y.Liao, Enhanced parallel cat swarm optimization based on the Taguchi algorithm, Expert Systems with Applications39(7) (2012), 6309–6319.
31.
P.W.Tsai, J.S.Pan, S.M.Chen, B.Y.Liao and S.P.Hao, Parallel cat swarm optimization, in: International Conference on Machine Learning and Cybernetics, Vol. 6, 2008, pp. 3328–3333.
32.
F.Yang, T.Sun and C.Zhang, An efficient hybrid data clustering algorithm based on K-harmonic means and particle swarm optimization, Expert Systems with Applications36(6) (2009), 9847–9852.
33.
M.Yin, Y.Hu, F.Yang, X.Li and W.Gu, A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering, Expert Systems with Applications38(8) (2011), 9319–9324.
B.Zhang, M.Hsu and U.Dayal, K-harmonic means – A data clustering algorithm, Technical Report HPL-1999-124, Hewlett–Packard Laboratories, 1999.
36.
J.Zhang, H.S.H.Chung and W.L.Lo, Clustering-based adaptive crossover and mutation probabilities for genetic algorithms, IEEE Transactions on Evolutionary Computation11(3) (2007), 326–335.
