In this paper we propose a new robust estimation method based on random
projections which is adaptive, produces an automatic robust estimate, while
being easy to compute for high or infinite dimensional data. Under some
restricted contamination model, the procedure is robust and attains full
efficiency. We challenge the method with some simulation data and we apply it
to a real data example.
We herein introduce a new method of interpretable clustering that uses
unsupervised binary trees. It is a three-stage procedure, the first stage of
which entails a series of recursive binary splits to reduce the heterogeneity
of the data within the new subsamples. During the second stage (pruning),
consideration is given to whether adjacent nodes can be aggregated. Finally,
during the third stage (joining), similar clusters are joined together, even if
they do not descend from the same node originally.
We introduce a new clustering method based on unsupervised binary trees. It
is a three stages procedure, which performs on a first stage recursive binary
splits reducing the heterogeneity of the data within the new subsamples. On the
second stage (pruning) adjacent nodes are considered to be aggregated. Finally,
on the third stage (joining) similar clusters are joined even if they do not
descend from the same node. Consistency results are obtained and the procedure
is tested on simulated and real data sets