Mahmuddin, Massudi and Yusof, Yuhanis (2009) A near-optimal centroids initialization in K-means algorithm using bees algorithm. In: International Conference on Computing and Informatics 2009 (ICOCI09), 24-25 June 2009, Legend Hotel, Kuala Lumpur.

Preview

PDF Download (161kB) | Preview

Abstract

The K-mean algorithm is one of the popular clustering techniques.The algorithm requires user to state and initialize centroid values of each group in advance. This creates problem for novice users especially to those who have no or little knowledge on the data.Trial-error attempt might be one of the possible preference to deal with this issue.In this paper, an optimization algorithm inspired from the bees foraging activities is used to locate near-optimal centroid of a given data set.Result shows that propose approached prove it robustness and competence in finding a near optimal centroid on both synthetic and real data sets.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	ISBN 978-983--44150-2-0 Organized by: UUM College of Arts and Sciences, Universiti Utara Malaysia.
Uncontrolled Keywords:	Optimization, K-means, Nature-Inspired Algorithm
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Divisions:	College of Arts and Sciences
Depositing User:	Dr. Massudi Mahmuddin
Date Deposited:	01 Apr 2015 08:43
Last Modified:	01 Apr 2015 08:43
URI:	https://repo.uum.edu.my/id/eprint/13501

Actions (login required)

View Item