Trimming algorithms for clustering contaminated grouped data and their robustness
From MaRDI portal
Publication:2442773
Recommendations
- A general trimming approach to robust cluster analysis
- Wild adaptive trimming for robust estimation and cluster analysis
- Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method
- Robust clustering for functional data based on trimming and constraints
- A review of robust clustering methods
Cites work
- A constrained formulation of maximum-likelihood estimation for normal mixture distributions
- A general trimming approach to robust cluster analysis
- A robust method for cluster analysis
- An Appraisal and Bibliography of Tests for Multivariate Normality
- Clustering Criteria and Multivariate Normal Mixtures
- Estimating the dimension of a model
- Estimating the number of clusters in a data set via the gap statistic
- Finite mixture models
- scientific article; zbMATH DE number 621792 (Why is no real title available?)
- scientific article; zbMATH DE number 1472778 (Why is no real title available?)
- On some significance tests in cluster analysis
- Robust fitting of mixtures using the trimmed likelihood estimator
- Robustness Properties of k Means and Trimmed k Means
- Strong consistency of k-means clustering
- Testing for a Finite Mixture Model with Two Components
- The Masking Breakdown Point of Multivariate Outlier Identification Rules
- Trimmed \(k\)-means: An attempt to robustify quantizers
Cited in
(28)- The importance of the scales in heterogeneous robust clustering
- Clustering multivariate functional data in group-specific functional subspaces
- Robust, fuzzy, and parsimonious clustering, based on mixtures of factor analyzers
- Model-based clustering with determinant-and-shape constraint
- Robust and sparse \(k\)-means clustering for high-dimensional data
- Robust clustering for functional data based on trimming and constraints
- Assessing trimming methodologies for clustering linear regression data
- Probabilistic clustering via Pareto solutions and significance tests
- A data driven equivariant approach to constrained Gaussian mixture modeling
- A review of robust clustering methods
- Robust clusterwise linear regression through trimming
- Snipping for robust \(k\)-means clustering under component-wise contamination
- Local statistical modeling via a cluster-weighted approach with elliptical distributions
- Impact of Contamination on Training and Test Error Rates in Statistical Clustering
- A robust linear grouping algorithm
- A fast algorithm for robust constrained clustering
- On the breakdown behavior of the TCLUST clustering procedure
- Strong consistency of k-parameters clustering
- Wild adaptive trimming for robust estimation and cluster analysis
- Robust constrained fuzzy clustering
- Robust inference for parsimonious model-based clustering
- Avoiding spurious local maximizers in mixture modeling
- Exploring the number of groups in robust model-based clustering
- Robust clustering based on trimming
- The influence function of the TCLUST robust clustering procedure
- Robust Bregman clustering
- A general trimming approach to robust cluster analysis
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
This page was built for publication: Trimming algorithms for clustering contaminated grouped data and their robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442773)
