Max–min separability
The author introduces the notion of max-min separability for two finite point sets in a finite dimensional space, derives criteria for max-min separability and establishes an unconstrained optimization problem for minimizing an error function. Note that the notion of max-min separability contains the notions of linear and polyhedral separabilities as special cases, while the error function here is nonconvex piecewise linear. Making use of the discrete gradient method, he proposes an algorithm for solving the problem mentioned above. The author's numerical experiments with real-world datasets have shown the effectiveness of the algorithm.
- A global optimization approach to classification
- A Method for Minimization of Quasidifferentiable Functions
- A numerical method for finding best guaranteed estimates
- A Parametric Optimization Method for Machine Learning
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Continuous selections of linear functions and nonsmooth critical point theory
- Massive data discrimination via linear support vector machines
- Mathematical Programming for Data Mining: Formulations and Challenges
- Minmaxmin problems revisited
- Misclassification minimization
- On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
- Polyhedral separability through successive LP
- Semismooth and Semiconvex Functions in Constrained Optimization
- UOBYQA: unconstrained optimization by quadratic approximation
- A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them
- Alternating multiconlitron: a novel framework for piecewise linear classification
- Optimization approaches to supervised classification
- Hybrid misclassification minimization
- Margin maximization in spherical separation
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
- Support vector machine polyhedral separability in semisupervised learning
- Clustering based polyhedral conic functions algorithm in classification
- A polyhedral conic functions based classification method for noisy data
- Supervised classification and mathematical optimization
- A regression based approach to a maximum margin classifier for separation of linearly inseparable pattern classes
- Separation of two sets by piecewise linear function
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- Novel approaches to the discrimination problem
- Separating Hyperplanes and the Authorship of the Disputed Federalist Papers
- Minimizing the error of linear separators on linearly inseparable data
- On linear separability of sequences and structures
- Linear-integer separation of binary patterns by linear programming
- Robust spherical separation
- Codifferential method for minimizing nonsmooth DC functions
- Statistical Discrimination Analysis Using the Maximum Function
- Note on distribution-free estimation of maximum linear separation of two multivariate distributions
- Separation via polyhedral conic functions
- Supervised data classification via max-min separability
- scientific article; zbMATH DE number 2233588 (Why is no real title available?)
- Polyhedral separability through successive LP
- Maximum-margin polyhedral separation for binary multiple instance learning
- An incremental piecewise linear classifier based on polyhedral conic separation
- A partially inexact bundle method for convex semi-infinite minmax problems
This page was built for publication: Max–min separability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317750)
