Trimming algorithms for clustering contaminated grouped data and their robustness

DOI10.1007/S11634-009-0044-9zbMath1284.62372OpenAlexW2128310573MaRDI QIDQ2442773

María Teresa Gallegos, Gunter Ritter

Publication date: 1 April 2014

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-009-0044-9

zbMATH Keywords

heteroscedasticitybreakdown pointsrobust clusteringHDBT ratiostatistical clusteringtrimming algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Robustness and adaptive procedures (parametric inference) (62F35)

Related Items (18)

A fast algorithm for robust constrained clustering ⋮ On the breakdown behavior of the TCLUST clustering procedure ⋮ Strong consistency of \(k\)-parameters clustering ⋮ Probabilistic clustering via Pareto solutions and significance tests ⋮ A data driven equivariant approach to constrained Gaussian mixture modeling ⋮ Robust inference for parsimonious model-based clustering ⋮ Model-based clustering with determinant-and-shape constraint ⋮ A review of robust clustering methods ⋮ Robust constrained fuzzy clustering ⋮ Robust, fuzzy, and parsimonious clustering, based on mixtures of factor analyzers ⋮ Using combinatorial optimization in model-based trimmed clustering with cardinality constraints ⋮ Exploring the number of groups in robust model-based clustering ⋮ The influence function of the TCLUST robust clustering procedure ⋮ Avoiding spurious local maximizers in mixture modeling ⋮ Clustering multivariate functional data in group-specific functional subspaces ⋮ Robust and sparse \(k\)-means clustering for high-dimensional data ⋮ Snipping for robust \(k\)-means clustering under component-wise contamination ⋮ Local statistical modeling via a cluster-weighted approach with elliptical distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• Robust fitting of mixtures using the trimmed likelihood estimator
• A general trimming approach to robust cluster analysis
• A constrained formulation of maximum-likelihood estimation for normal mixture distributions
• On some significance tests in cluster analysis
• Strong consistency of k-means clustering
• Estimating the dimension of a model
• Trimmed \(k\)-means: An attempt to robustify quantizers
• A robust method for cluster analysis
• Clustering Criteria and Multivariate Normal Mixtures
• Finite mixture models
• The Masking Breakdown Point of Multivariate Outlier Identification Rules
• Robustness Properties of k Means and Trimmed k Means
• Testing for a Finite Mixture Model with Two Components
• An Appraisal and Bibliography of Tests for Multivariate Normality

This page was built for publication: Trimming algorithms for clustering contaminated grouped data and their robustness