Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Kumar, Yugal; * | Sahoo, G.
Affiliations: Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand, India. E-mails: [email protected], [email protected]
Correspondence: [*] Corresponding author. E-mail: [email protected].
Abstract: 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.
Keywords: Cat swarm optimization, data clustering, K-harmonic means, gravitational search algorithm, particle swarm optimization
DOI: 10.3233/AIC-150677
Journal: AI Communications, vol. 28, no. 4, pp. 751-764, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]