By Topic

Efficient global clustering using the greedy elimination method

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
$33 $33
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

2 Author(s)
Z. S. H. Chan ; Knowledge Eng. Discovery & Res. Inst., Auckland Univ. of Technol., New Zealand ; N. Kasabov

A novel global clustering method called the greedy elimination method is presented. Experiments show that the proposed method scores significantly lower clustering errors than the standard K-means over two benchmark and two application datasets, and it is efficient for handling large datasets.

Published in:

Electronics Letters  (Volume:40 ,  Issue: 25 )