Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Abstract : Using quantization techniques, Laloë (2009) defined a new algorithm called Alter. This $L^1$-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 of $K$ 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Rémi Servien <>
Submitted on : Sunday, April 8, 2012 - 8:40:32 AM
Last modification on : Saturday, May 29, 2021 - 10:17:20 AM
Long-term archiving on: : Wednesday, December 14, 2016 - 9:26:47 PM


Files produced by the author(s)


  • HAL Id : hal-00674407, version 4


Thomas Laloë, Rémi Servien. The X-Alter algorithm : a parameter-free method to perform unsupervised clustering. 2011. ⟨hal-00674407v4⟩



Record views


Files downloads