Polyhedral separability through successive LP

DOI10.1023/A:1013649822153zbMath1049.90039WikidataQ62473108 ScholiaQ62473108MaRDI QIDQ5959910

Annabella Astorino, Manlio Gaudioso

Publication date: 11 April 2002

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

Full work available at URL: https://doi.org/10.1023/a:1013649822153

zbMATH Keywords

Classification, separability, machine learning

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

Mathematical diagnostics via nonsmooth analysis, Data pre-classification and the separation law for closed bounded convex sets, Ellipsoidal separation for classification problems, Max–min separability, Separation via polyhedral conic functions, Efficient MIP techniques for computing the relaxation complexity, On the problem polyhedral separability: a numerical solution, On numerical solving the spherical separability problem, A DC optimization-based clustering technique for edge detection, DC models for spherical separation, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, On the solution of min-sum-min problems, A fixed-center spherical separation algorithm with kernel transformations for classification problems, An incremental piecewise linear classifier based on polyhedral conic separation, Optimization approaches to supervised classification, Margin maximization in spherical separation, A novel piecewise linear classifier based on polyhedral conic and max-min separabilities, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, Polyhedral separation via difference of convex (DC) programming, A characterization of 2-threshold functions via pairs of prime segments, An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier, Classification through incremental max-min separability, Support vector machine polyhedral separability in semisupervised learning, Accurately learning from few examples with a polyhedral classifier, A constraint generation algorithm for large scale linear programs using multiple-points separation, The method of virtual experts in mathematical diagnostics, Clustering based polyhedral conic functions algorithm in classification, A polyhedral conic functions based classification method for noisy data, Separation of convex sets by Clarke subdifferential, An approach to classification based on separation of sets by means of several ellipsoids

Uses Software

• SVMlight

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of polyhedral separability
• Arbitrary-norm separating plane
• Bilinear separation of two sets in \(n\)-space
• Misclassification minimization
• Feature minimization within decision trees
• Improved generalization via tolerant training
• Hybrid misclassification minimization
• Mathematical Programming Methods of Pattern Classification
• Mathematical Programming in Neural Networks
• A Parametric Optimization Method for Machine Learning
• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• Massive data discrimination via linear support vector machines
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Multisurface method of pattern separation