Clustering via minimum volume ellipsoids

DOI10.1007/s10589-007-9024-1zbMath1180.90230OpenAlexW2046701389MaRDI QIDQ2385541

Romy Shioda, Tunçel, Levent

Publication date: 12 October 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9024-1

zbMATH Keywords

learning theoryinscribing ellipsoids

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Interior-point methods (90C51)

Related Items (3)

Conditional minimum volume ellipsoid with application to multiclass discrimination ⋮ Affine-transformation invariant clustering models ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs

Uses Software

• Matlab
• mclust
• MVE

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-volume enclosing ellipsoids and core sets
• Scale-invariant clustering with minimum volume ellipsoids
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
• Über monotone Matrixfunktionen
• Pattern separation by convex programming
• Clustering Criteria and Multivariate Normal Mixtures
• On Numerical Solution of the Maximum Volume Ellipsoid Problem
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• An Algorithm for Separating Patterns by Ellipsoids
• Rounding of Polytopes in the Real Number Model of Computation
• Optimal outlier removal in high-dimensional
• Computation of Minimum-Volume Covering Ellipsoids

This page was built for publication: Clustering via minimum volume ellipsoids