Optimal expected-distance separating halfspace

DOI10.1287/MOOR.1070.0309MaRDI QIDQ3168987zbMATH OpenOpenAlexFDO

Authors Frank Plastria, Emilio Carrizosa

Publication date 27 April 2011

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1070.0309

zbMATH Keywords

discriminant analysisgauge-distance to hyperplaneseparating halfspace

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Continuous location (90B85) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

Recommendations

• Linear separation and approximation by minimizing the sum of concave functions of distances
• Novel approaches to the discrimination problem
• Robust set separation via exponentials.
• A new implicit enumeration scheme for the discriminant analysis problem
• Arbitrary-norm separating plane

Cited in

(7)

• Minmax-distance approximation and separation problems: geometrical properties
• Generalized isotone projection cones
• Supervised classification and mathematical optimization
• Generalized projections onto convex sets
• Linear separation and approximation by minimizing the sum of concave functions of distances
• Mathematical optimization modelling for group counterfactual explanations
• Alternating local search based VNS for linear classification

This page was built for publication: Optimal expected-distance separating halfspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168987)