Clustering via minimum volume ellipsoids (Q2385541): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9024-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046701389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separating Patterns by Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal outlier removal in high-dimensional / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Based Clustering, Discriminant Analysis, and Density Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of Polytopes in the Real Number Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-invariant clustering with minimum volume ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-volume enclosing ellipsoids and core sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über monotone Matrixfunktionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern separation by convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Minimum-Volume Covering Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Criteria and Multivariate Normal Mixtures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Numerical Solution of the Maximum Volume Ellipsoid Problem / rank
 
Normal rank

Latest revision as of 10:00, 27 June 2024

scientific article
Language Label Description Also known as
English
Clustering via minimum volume ellipsoids
scientific article

    Statements

    Clustering via minimum volume ellipsoids (English)
    0 references
    0 references
    0 references
    12 October 2007
    0 references
    inscribing ellipsoids
    0 references
    learning theory
    0 references
    0 references
    0 references
    0 references

    Identifiers