The algorithm of noisy k-means - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

The algorithm of noisy k-means

(1) , (1)


In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different tools from the inverse problem literature and the machine learning community. Coarsely, it is based on a two-step procedure: (1) a deconvolution step to deal with noisy inputs and (2) Newton's iterations as the popular k-means.
Fichier principal
Vignette du fichier
noisykmeans.pdf (772.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00851484 , version 1 (14-08-2013)



Camille Brunet, Sébastien Loustau. The algorithm of noisy k-means. 2013. ⟨hal-00851484⟩
276 View
857 Download



Gmail Facebook Twitter LinkedIn More