Multisurface method of pattern separation

Authors:
O. Mangasarian
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

A Multi-criteria Convex Quadratic Programming model for credit data analysis

Decision Support Systems
Pattern classification by concurrently determined piecewise linear and convex discriminant functions

Computers and Industrial Engineering
On data classification by iterative linear partitioning

Discrete Applied Mathematics
Novel linear programming approach for building a piecewise nonlinear binary classifier with a priori accuracy

Decision Support Systems
A clustering technique for the identification of piecewise affine systems

Automatica (Journal of IFAC)
Arbitrary-norm separating planefn1fn1This material is based on research supported by NSF Grant CCR-9322479 and AFOSR Grant F49620-97-1-0326.

Operations Research Letters
Improving the efficiency of a mixed integer linear programming based approach for multi-class classification problem

Computers and Industrial Engineering

Quantified Score

Hi-index	754.84

Visualization

Abstract

Let two sets of patterns be represented by two finite point sets in ann-dimensional Euclidean spaceE^{n}. If the convex hulls of the two sets do not intersect, the sets can be strictly separated by a plane. Such a plane can be constructed by the Motzkin-Schoenberg error-correction procedure or by linear programming. More often than not, however, the convex hulls of the two point sets do intersect, in which case strict separation by a plane is not possible any more. One may then resort to separation by more than one plane. In this paper, we show how two sets can be strictly separated by one or more planes or surfaces (nonlinear manifolds) via linear programming. A computer program that implements the present method has been written and successfully tested on a number of real problems.