Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
From MaRDI portal
Publication:962299
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
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3129892 (Why is no real title available?)
- scientific article; zbMATH DE number 3986407 (Why is no real title available?)
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 17627 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1348600 (Why is no real title available?)
- scientific article; zbMATH DE number 621792 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 1472778 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A New Approach to Cluster Analysis: the Clustering-Function-Based Method
- A central limit theorem for k-means clustering
- 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
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Asymptotic distributions for clustering criteria
- Clustering Criteria and Multivariate Normal Mixtures
- Consistent estimation of the order of mixture models.
- Efficient Algorithms for the Hitchcock Transportation Problem
- Estimating the dimension of a model
- Estimating the number of clusters in a data set via the gap statistic
- Experiments with, and on, algorithms for maximum likelihood clustering
- Fast Algorithms for Bipartite Network Flow
- Faster Scaling Algorithms for Network Problems
- Finding Minimum-Cost Circulations by Successive Approximation
- Finite mixture models
- Geometric algorithms for the minimum cost assignment problem
- Identification of Outliers in Multivariate Data
- Improved Algorithms for Bipartite Network Flow
- Minkowski-type theorems and least-squares clustering
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- On some significance tests in cluster analysis
- Robust fitting of mixtures using the trimmed likelihood estimator
- Solving the Assignment Problem by Relaxation
- Some computational issues in cluster analysis with no a priori metric
- Strong consistency of k-means clustering
- Testing for a Finite Mixture Model with Two Components
- The Identification of Multiple Outliers
- The Masking Breakdown Point of Multivariate Outlier Identification Rules
- The complexity of computing the MCD-estimator
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Trimming algorithms for clustering contaminated grouped data and their robustness
Cited in
(11)- Robust inference for parsimonious model-based clustering
- Strong consistency of \(k\)-parameters clustering
- Robust joint modeling of mean and dispersion through trimming
- Anomaly and novelty detection for robust semi-supervised learning
- Size matters: cardinality-constrained clustering and outlier detection via conic optimization
- Probabilistic clustering via Pareto solutions and significance tests
- Snipping for robust \(k\)-means clustering under component-wise contamination
- Editorial: Second special issue on statistical algorithms and software
- Exploring the number of groups in robust model-based clustering
- Comments on ``The power of monitoring: how to make the most of a contaminated multivariate sample
- 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)
