Linear separation and approximation by minimizing the sum of concave functions of distances

DOI10.1007/s10288-013-0245-0zbMath1297.90074OpenAlexW2071760804MaRDI QIDQ457295

Emilio Carrizosa, Frank Plastria

Publication date: 26 September 2014

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107725

zbMATH Keywords

linear approximationdistance minimizationlinear separation

Mathematics Subject Classification ID

Related Items (2)

Optimization approaches to supervised classification ⋮ Locating a median line with partial coverage distance

Cites Work

• Alternating local search based VNS for linear classification
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
• Weber problems with alternative transportation systems
• Arbitrary-norm separating plane
• Misclassification minimization
• Nontraditional approaches to statistical classification: Some perspectives on \(L_ p\)-norm methods
• Hybrid misclassification minimization
• Minmax-distance approximation and separation problems: geometrical properties
• Optimal Expected-Distance Separating Halfspace
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• Gauge distances and median hyperplanes

This page was built for publication: Linear separation and approximation by minimizing the sum of concave functions of distances