Clustering based on improved bee colony algorithm
by Yonghao Xiao; Weiyu Yu; Yunfei Cao; Haishu Tan
International Journal of Computer Applications in Technology (IJCAT), Vol. 46, No. 3, 2013

Abstract: Clustering is concerned with partitioning a dataset into homogeneous groups. One of the most popular clustering methods is k-means clustering because of its simplicity and computational efficiency. K-means clustering involves search and optimisation. The main problem with this clustering method is its tendency to converge to local optima. Bee colony algorithm has emerged as one of the robust and efficient global search heuristics of current interest. This paper describes an application of improved bee colony algorithm to the clustering of data and image segmentation. In contrast to most of the existing clustering techniques, the proposed approach requires no prior knowledge of the data to be classified. Rather, it determines the optimal number of partitions of the data 'on the run'.

Online publication date: Wed, 29-May-2013

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 Computer Applications in Technology (IJCAT):
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 subs@inderscience.com