A general trimming approach to robust Cluster Analysis

Abstract

We introduce a new method for performing clustering with the aim of fitting clusters with different scatters and weights. It is designed by allowing to handle a proportion $\alpha$ of contaminating data to guarantee the robustness of the method. As a characteristic feature, restrictions on the ratio between the maximum and the minimum eigenvalues of the groups scatter matrices are introduced. This makes the problem to be well defined and guarantees the consistency of the sample solutions to the population ones. The method covers a wide range of clustering approaches depending on the strength of the chosen restrictions. Our proposal includes an algorithm for approximately solving the sample problem.

Published in at http://dx.doi.org/10.1214/07-AOS515 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (2)

• Breakdown points for maximum likelihood estimators of location-scale mixtures
• A robust method for cluster analysis

Cited by in corpus (12)

• Anomaly Detection by Robust Statistics
• Robust improper maximum likelihood: tuning, computation, and a comparison with other methods for robust Gaussian clustering
• Robust clustering tools based on optimal transportation
• Solution Path Clustering with Adaptive Concave Penalty
• Similarity of samples and trimming
• Anomaly and Novelty detection for robust semi-supervised learning
• A robust approach to model-based classification based on trimming and constraints
• Finding Outliers in Gaussian Model-Based Clustering
• Estimating the number of neurons in multi-neuronal spike trains
• Cellwise outlier detection in heterogeneous populations
• Clustering genomic words in human DNA using peaks and trends of distributions
• Improving Model Choice in Classification: An Approach Based on Clustering of Covariance Matrices