Non-flat clustering whith alpha-divergences - École polytechnique Access content directly
Conference Papers Year : 2011

Non-flat clustering whith alpha-divergences


The scope of the well-known $k$-means algorithm has been broadly extended with some recent results: first, the k-means++ initialization method gives some approximation guarantees; second, the Bregman k-means algorithm generalizes the classical algorithm to the large family of Bregman divergences. The Bregman seeding framework combines approximation guarantees with Bregman divergences. We present here an extension of the k-means algorithm using the family of alpha-divergences. With the framework for representational Bregman divergences, we show that an alpha-divergence based k-means algorithm can be designed. We present preliminary experiments for clustering and image segmentation applications. Since alpha-divergences are the natural divergences for constant curvature spaces, these experiments are expected to give information on the structure of the data.
Fichier principal
Vignette du fichier
alpha-means.pdf (283.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00708634 , version 1 (15-06-2012)



Olivier Schwander, Frank Nielsen. Non-flat clustering whith alpha-divergences. ICASSP, May 2011, Prague, Czech Republic. pp.2100 - 2103, ⟨10.1109/ICASSP.2011.5946740⟩. ⟨hal-00708634⟩
678 View
687 Download



Gmail Facebook X LinkedIn More