The X-Alter algorithm : a parameter-free method to perform unsupervised clustering

Using quantization techniques, Laloë (2009) defined a new algorithm called Alter. This L1-based algorithm is proved to be convergent, but suffers two shortcomings. First, the number of clusters, K, has to be supplied by the user. Second, it has high complexity. In this article, we adapt the idea of...

Full description

Saved in:
Bibliographic Details
Published inJournal of Modern Applied Statistical Methods 1 (12), 90-102. (2013)
Main Authors Laloë, Thomas, Servien, Remi
Format Publication
LanguageEnglish
Published 2013
Subjects
Online AccessGet more information

Cover

Loading…
More Information
Summary:Using quantization techniques, Laloë (2009) defined a new algorithm called Alter. This L1-based algorithm is proved to be convergent, but suffers two shortcomings. First, the number of clusters, K, has to be supplied by the user. Second, it has high complexity. In this article, we adapt the idea of X-means algorithm (Pelleg and Moore; 2000) to offer solutions for these problems. This fast algorithm is used as a building-block which quickly estimates K by optimizing locally the Bayesian Information Criterion (BIC). Our algorithm combines advantages of X-means (calculation o fK and speed) and Alter (convergence and parameter-free). Finally, an aggregative step is performed to adjust the relevance of the final clustering according to BIC criterion. We confront here our algorithm to different real and simulated data sets, which shows its relevance.
Bibliography:http://prodinra.inra.fr/ft/C3872B35-4ED2-4D2B-8193-AD5383ED0728
http://prodinra.inra.fr/record/265684