Gaussian cat swarm optimisation algorithm based on Monte Carlo method for data clustering
by Yugal Kumar; Gadadhar Sahoo
International Journal of Computational Science and Engineering (IJCSE), Vol. 14, No. 2, 2017

Abstract: Clustering is a popular data analysis technique to find the hidden relationship between patterns. It is an unsupervised technique which is applied to obtain the optimal cluster centres especially in partitioned-based clustering algorithms. Cat swarm optimisation (CSO) is a new meta-heuristic algorithm which has been applied to solve various optimisation problems and it provides better results in comparison to same class of algorithms. But, this algorithm suffers from diversity and local optima problems. This study presents a new hybrid CSO algorithm by incorporating Monte Carlo-based search equation and population centroid (PopC) operator with Gaussian probability distribution. Monte Carlo-based search equation is applied to enhance the diversity of the CSO algorithm. The population centroid (PopC) operator is used to prevent the CSO algorithm from trapping in local optima. The performance of the proposed algorithm is tested with several artificial and real datasets and compared with existing methods like K-means and PSO. The experimental results indicate that the proposed algorithm is a robust and effective algorithm to handle the clustering problems.

Online publication date: Wed, 15-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email