Outliers detection strategy for a Curve Clustering Algorithm

In recent years curve clustering problem has been handled in several applicative fields. However, most of them are sensitive to outliers. This paper aims to deal with this problem in order to make a partition, obtained by using a Dynamic Curve Clustering Algorithm with free knots spline estimation, more robust. The approach is based on a leave-some-out strategy, which defines a rule on the distances distribution of the curves from the barycenters in order to identify outliers regions. The method is validated by two applications on real data.