Using combinatorial optimization in model-based trimmed clustering with cardinality constraints

DOI10.1016/j.csda.2009.08.023zbMath1464.62075OpenAlexW2125924636MaRDI QIDQ962299

María Teresa Gallegos, Gunter Ritter

Publication date: 6 April 2010

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2009.08.023

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Robustness and adaptive procedures (parametric inference) (62F35) Combinatorial optimization (90C27)

Related Items

A fast algorithm for robust constrained clustering ⋮ Strong consistency of \(k\)-parameters clustering ⋮ Probabilistic clustering via Pareto solutions and significance tests ⋮ Robust inference for parsimonious model-based clustering ⋮ Robust joint modeling of mean and dispersion through trimming ⋮ Editorial: Second special issue on statistical algorithms and software ⋮ Exploring the number of groups in robust model-based clustering ⋮ Anomaly and novelty detection for robust semi-supervised learning ⋮ Comments on ``The power of monitoring: how to make the most of a contaminated multivariate sample ⋮ Snipping for robust \(k\)-means clustering under component-wise contamination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The complexity of computing the MCD-estimator
• A general trimming approach to robust cluster analysis
• Experiments with, and on, algorithms for maximum likelihood clustering
• A constrained formulation of maximum-likelihood estimation for normal mixture distributions
• On some significance tests in cluster analysis
• Strong consistency of k-means clustering
• A central limit theorem for k-means clustering
• Asymptotic distributions for clustering criteria
• Estimating the dimension of a model
• Trimmed \(k\)-means: An attempt to robustify quantizers
• Minkowski-type theorems and least-squares clustering
• A robust method for cluster analysis
• Some computational issues in cluster analysis with no a priori metric
• Trimming algorithms for clustering contaminated grouped data and their robustness
• The Identification of Multiple Outliers
• Finding Minimum-Cost Circulations by Successive Approximation
• A New Approach to Cluster Analysis: the Clustering-Function-Based Method
• Fast Algorithms for Bipartite Network Flow
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Solving the Assignment Problem by Relaxation
• Clustering Criteria and Multivariate Normal Mixtures
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Improved Algorithms for Bipartite Network Flow
• Identification of Outliers in Multivariate Data
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• The Masking Breakdown Point of Multivariate Outlier Identification Rules
• Testing for a Finite Mixture Model with Two Components
• Faster Scaling Algorithms for Network Problems
• An Appraisal and Bibliography of Tests for Multivariate Normality
• Efficient Algorithms for the Hitchcock Transportation Problem
• Geometric algorithms for the minimum cost assignment problem