Farthest centroids divisive clustering

Haw Ren Fang, Yousef Saad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into two subsets whose centroids are farthest from each other, and the process is repeated recursively on each subset. An approximate algorithm is proposed to solve the original integer programming problem which is NP-hard. Experimental evidence shows that the clustering method often outperforms a standard spectral clustering method, albeit at a slightly higher computational cost. The paper also discusses improvements of the standard K-means algorithm. Specifically, the clustering quality resulting from the K-means technique can be significantly enhanced by using the proposed algorithm for its initialization.

Original languageEnglish (US)
Title of host publicationProceedings - 7th International Conference on Machine Learning and Applications, ICMLA 2008
Pages232-238
Number of pages7
DOIs
StatePublished - Dec 1 2008
Event7th International Conference on Machine Learning and Applications, ICMLA 2008 - San Diego, CA, United States
Duration: Dec 11 2008Dec 13 2008

Publication series

NameProceedings - 7th International Conference on Machine Learning and Applications, ICMLA 2008

Other

Other7th International Conference on Machine Learning and Applications, ICMLA 2008
CountryUnited States
CitySan Diego, CA
Period12/11/0812/13/08

Fingerprint Dive into the research topics of 'Farthest centroids divisive clustering'. Together they form a unique fingerprint.

Cite this