Published in

Springer (part of Springer Nature), Advances in Data Analysis and Classification, 1(13), p. 201-225, 2018

DOI: 10.1007/s11634-018-0312-7

Links

Tools

Export citation

Search in Google Scholar

Robust clustering for functional data based on trimming and constraints

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Many clustering algorithms when the data are curves or functions have been recently proposed. However, the presence of contamination in the sample of curves can influence the performance of most of them. In this work we propose a robust, model-based clustering method based on an approximation to the "density function" for functional data. The robustness results from the joint application of trimming, for reducing the effect of contaminated observations, and constraints on the variances, for avoiding spurious clusters in the solution. The proposed method has been evaluated through a simulation study. Finally, an application to a real data problem is given. ; Comment: 19 pages, 6 figures, 2 tables