Robust improper maximum likelihood: tuning, computation, and a comparison with other methods for robust Gaussian clustering
Not on the map. Why?
Abstract (arXiv)
The two main topics of this paper are the introduction of the "optimally tuned improper maximum likelihood estimator" (OTRIMLE) for robust clustering based on the multivariate Gaussian model for clusters, and a comprehensive simulation study comparing the OTRIMLE to Maximum Likelihood in Gaussian mixtures with and without noise component, mixtures of t-distributions, and the TCLUST approach for trimmed clustering. The OTRIMLE uses an improper constant density for modelling outliers and noise. This can be chosen optimally so that the non-noise part of the data looks as close to a Gaussian mixture as possible. Some deviation from Gaussianity can be traded in for lowering the estimated noise proportion. Covariance matrix constraints and computation of the OTRIMLE are also treated. In the simulation study, all methods are confronted with setups in which their model assumptions are not exactly fulfilled, and in order to evaluate the experiments in a standardized way by misclassification rates, a new model-based definition of "true clusters" is introduced that deviates from the usual identification of mixture components with clusters. In the study, every method turns out to be superior for one or more setups, but the OTRIMLE achieves the most satisfactory overall performance. The methods are also applied to two real datasets, one without and one with known "true" clusters.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Jun 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 2.
5 papers.
- 2024TopoFR: A Closer Look at Topology Alignment on Face Recognitioncited by 13
- 2023Likelihood Annealing: Fast Calibrated Uncertainty for Regressioncited by 3
- 2024Adaptively Robust and Sparse K-means Clusteringcited by 1
- 2021Selecting the number of clusters, clustering models, and algorithms. A unifying approach based on the quadratic discriminant scorecited by 0
- 2023Federated Learning for Short Text Clusteringcited by 0
- 2024TopoFR: A Closer Look at Topology Alignment on Face Recognition14 Oct 2024
- 2024Adaptively Robust and Sparse K-means Clustering9 Jul 2024
- 2023Federated Learning for Short Text Clustering23 Nov 2023
- 2023Likelihood Annealing: Fast Calibrated Uncertainty for Regression21 Feb 2023
- 2021Selecting the number of clusters, clustering models, and algorithms. A unifying approach based on the quadratic discriminant score3 Nov 2021