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

DOI10.1016/J.CSDA.2009.08.023zbMATH Open1464.62075OpenAlexW2125924636MaRDI QIDQ962299FDOQ962299

Authors: 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

Recommendations

• Trimming algorithms for clustering contaminated grouped data and their robustness
• Size matters: cardinality-constrained clustering and outlier detection via conic optimization
• A general trimming approach to robust cluster analysis
• Exploring the number of groups in robust model-based clustering
• Wild adaptive trimming for robust estimation and cluster analysis

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)

Cites Work

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

Cited In (10)

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

This page was built for publication: Using combinatorial optimization in model-based trimmed clustering with cardinality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962299)