We propose a robust heteroscedastic model-based clustering method based on snipping. An observation is snipped when some of its dimensions are discarded, but the remaining are used for estimation. An expectation-maximization algorithm augmented with a stochastic optimization step is used to derive inference, and its convergence properties are studied. We show global robustness of our resulting sclust procedure also when outliers arise entry-wise. The method is robust to contamination, even when most or even all of the observations contain outliers. Simulations and two real data applications illustrate and compare the approach with existing methods
We study the problem of clustering a set of data points based on their similarity matrix, each entry...
Constrained clustering addresses the problem of creating minimum variance clusters with the added co...
Clustering problems and clustering algorithms are often overly sensitive to the presence of outliers...
We propose a model-based clustering procedure where each component can take into account cluster-spe...
Robust methods are needed to fit regression lines when outliers are present. In a clustering framewo...
We introduce a robust k-means-based clustering method for high-dimensional data where not only outli...
In this paper we examine some of the relationships between two important optimization problems that ...
This dissertation broadly focuses on developing robust machine learning and optimization approaches ...
International audienceBoth clustering and outlier detection tasks have a wide range of applications ...
A new methodology for robust clustering without specifying in advance the underlying number of Gaus...
new robust model based clustering method is proposed, which is based on trimming and reweighting. In...
Plain vanilla K-means clustering is prone to produce unbalanced clusters and suffers from outlier se...
The Optimally Tuned Robust Improper Maximum Likelihood Estima- tor (OTRIMLE) for robust model-based ...
International audienceIt is well known that the classical single linkage algorithm usually fails to ...
We study the problem of clustering a set of data points based on their similarity matrix, each entry...
Constrained clustering addresses the problem of creating minimum variance clusters with the added co...
Clustering problems and clustering algorithms are often overly sensitive to the presence of outliers...
We propose a model-based clustering procedure where each component can take into account cluster-spe...
Robust methods are needed to fit regression lines when outliers are present. In a clustering framewo...
We introduce a robust k-means-based clustering method for high-dimensional data where not only outli...
In this paper we examine some of the relationships between two important optimization problems that ...
This dissertation broadly focuses on developing robust machine learning and optimization approaches ...
International audienceBoth clustering and outlier detection tasks have a wide range of applications ...
A new methodology for robust clustering without specifying in advance the underlying number of Gaus...
new robust model based clustering method is proposed, which is based on trimming and reweighting. In...
Plain vanilla K-means clustering is prone to produce unbalanced clusters and suffers from outlier se...
The Optimally Tuned Robust Improper Maximum Likelihood Estima- tor (OTRIMLE) for robust model-based ...
International audienceIt is well known that the classical single linkage algorithm usually fails to ...
We study the problem of clustering a set of data points based on their similarity matrix, each entry...
Constrained clustering addresses the problem of creating minimum variance clusters with the added co...
Clustering problems and clustering algorithms are often overly sensitive to the presence of outliers...