Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Improvement to the K-Means algorithm through a heuristics based on a bee honeycomb structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)

The object clustering problem, according to their similarity measures, can be formulated as a combinatorial optimization problem. The K-Means algorithm has been widely used for solving such problem; however, its computational cost is very high. In this work a new heuristics is proposed for reducing the computational complexity in the classification step of the algorithm based on a honeycomb structure, which the algorithm builds when clusters are visualized in a two-dimensional space. In particular it has been observed that an object can only change membership to neighboring clusters. The heuristics consists of performing distance calculations only with respect to centroids of neighboring clusters, which reduces the number of calculations. For assessing the performance of this heuristics, a set of experiments was carried out that involved 2500, 10000 and 40000 objects uniformly distributed in a two-dimensional space, as well as real-world instances of 3100 and 245 057 objects with 2 and 3 dimensions. The results were encouraging, since the calculation time was reduced 65% on average, with respect to the standard K-Means algorithm for the synthetic instance, and up to 62% on average for the real-world instances, while the quality was reduced on average by 0.05% and 2.5%, respectively.

Published in:

Nature and Biologically Inspired Computing (NaBIC), 2012 Fourth World Congress on

Date of Conference:

5-9 Nov. 2012