A hybrid monkey search algorithm for clustering analysis

29Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Clustering is a popular data analysis and data mining technique. The k -means clustering algorithm is one of the most commonly used methods. However, it highly depends on the initial solution and is easy to fall into local optimum solution. In view of the disadvantages of the k -means method, this paper proposed a hybrid monkey algorithm based on search operator of artificial bee colony algorithm for clustering analysis and experiment on synthetic and real life datasets to show that the algorithm has a good performance than that of the basic monkey algorithm for clustering analysis. © 2014 Xin Chen et al.

Cite

CITATION STYLE

APA

Chen, X., Zhou, Y., & Luo, Q. (2014). A hybrid monkey search algorithm for clustering analysis. The Scientific World Journal, 2014. https://doi.org/10.1155/2014/938239

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free