Clustering "optimal" dans des espaces fonctionnels

Abstract : Computer codes used in support of nuclear industry are more and more complex, and consequently more and more CPU time consuming. We are here interested in such code, in the special case of functional output : the code output represents the evolutions of some physical parameters in time. Those last curves are functions from an interval $I \subset \R$ to $\R$, which will be preprocessed in order to cluster them in a few meaningful groups (clustering, or unsupervised classification). The aim of our work is the estimation of the convergence speed of clustering error estimates. After finding bounds on convergence speeds, we will illustrate this on an example with six distinct groups of curves.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00386593
Contributor : Conférence Jds2009 <>
Submitted on : Friday, May 22, 2009 - 9:04:42 AM
Last modification on : Monday, October 1, 2018 - 4:03:30 PM
Long-term archiving on : Thursday, June 10, 2010 - 11:33:15 PM

File

p175.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00386593, version 1

Collections

Citation

Benjamin Auder, Bertrand Iooss. Clustering "optimal" dans des espaces fonctionnels. 41èmes Journées de Statistique, SFdS, Bordeaux, 2009, Bordeaux, France, France. ⟨inria-00386593⟩

Share

Metrics

Record views

170

Files downloads

206