ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Pattern Recognition
Volume 36, Issue 2, February 2003, Pages 451-461
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (240 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0031-3203(02)00060-2    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Pattern Recognition Society. Published by Elsevier Science B.V.

The global k-means clustering algorithm

Aristidis LikasCorresponding Author Contact Information, E-mail The Corresponding Author, a, Nikos Vlassisb and Jakob J. Verbeekb

a Department of Computer Science, University of Ioannina, 45110, Ioannina, Greece b Computer Science Institute, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

Received 23 March 2001; 
accepted 4 March 2002. 
Available online 14 May 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We present the global k-means algorithm which is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure consisting of N (with N being the size of the data set) executions of the k-means algorithm from suitable initial positions. We also propose modifications of the method to reduce the computational load without significantly affecting solution quality. The proposed clustering methods are tested on well-known data sets and they compare favorably to the k-means algorithm with random restarts.

Author Keywords: Clustering; k-Means algorithm; Global optimization; k-d Trees; Data mining

Article Outline

1. Introduction
2. The global k-means algorithm
3. Speeding-up execution
3.1. The fast global k-means algorithm
3.2. Initialization with k-d trees
4. Experimental results
4.1. Texture segmentation
4.2. Artificial data
5. Discussion and conclusions
6. Summary
Acknowledgements
References
Vitae











Pattern Recognition
Volume 36, Issue 2, February 2003, Pages 451-461
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.