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

The algorithm of noisy k-means

Abstract : 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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00851484
Contributor : Sébastien Loustau <>
Submitted on : Wednesday, August 14, 2013 - 2:08:09 PM
Last modification on : Monday, March 9, 2020 - 6:15:54 PM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 8:46:19 PM

Files

noisykmeans.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00851484, version 1
  • ARXIV : 1308.3314

Collections

Citation

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

Share

Metrics

Record views

439

Files downloads

318