Clustering via minimum volume ellipsoids
From MaRDI portal
Publication:2385541
Recommendations
Cites work
- An Algorithm for Separating Patterns by Ellipsoids
- Clustering Criteria and Multivariate Normal Mixtures
- Computation of Minimum-Volume Covering Ellipsoids
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- Minimum-volume enclosing ellipsoids and core sets
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Optimal outlier removal in high-dimensional
- Pattern separation by convex programming
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- Rounding of Polytopes in the Real Number Model of Computation
- Scale-invariant clustering with minimum volume ellipsoids
- Über monotone Matrixfunktionen
Cited in
(5)- Affine-transformation invariant clustering models
- On minimal valid inequalities for mixed integer conic programs
- A multiseed non-hierarchical clustering technique for data analysis
- Conditional minimum volume ellipsoid with application to multiclass discrimination
- Scale-invariant clustering with minimum volume ellipsoids
This page was built for publication: Clustering via minimum volume ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385541)