Experiments with, and on, algorithms for maximum likelihood clustering
From MaRDI portal
Publication:957004
DOI10.1016/j.csda.2003.11.002zbMath1429.62269OpenAlexW2048785430MaRDI QIDQ957004
Torsten Reiners, David L. Woodruff
Publication date: 26 November 2008
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2003.11.002
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (max. 100)
A review of robust clustering methods ⋮ Applications of optimization heuristics to estimation and modelling problems ⋮ Linear grouping using orthogonal regression ⋮ Using combinatorial optimization in model-based trimmed clustering with cardinality constraints ⋮ Exploring the number of groups in robust model-based clustering ⋮ The importance of the scales in heterogeneous robust clustering ⋮ A matching algorithm for the distribution of human pancreatic islets
Uses Software
Cites Work
- The complexity of computing the MCD-estimator
- Design of hybrids for the minimum sum-of-squares clustering problem
- The feasible solution algorithm for the minimum covariance determinant estimator in multivariate data
- Validating visual clusters in large datasets: fixed point clusters of spectral features.
- Optimization software class libraries
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Tabu Search—Part I
- Model-Based Gaussian and Non-Gaussian Clustering
- The Reactive Tabu Search
- Computable Robust Estimation of Multivariate Location and Shape in High Dimension Using Compound Estimators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experiments with, and on, algorithms for maximum likelihood clustering
