Pattern Classifier Design by Linear Programming
- 1 April 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-17 (4), 367-372
- https://doi.org/10.1109/tc.1968.229395
Abstract
Abstract—A common nonparametric method for designing linear discriminant functions for pattern classification is the iterative, or "adaptive," weight adjustment procedure, which designs the discriminant function to do well on a set of typical patterns. This paper presents a linear programming formulation of discriminant function design which minimizes the same objective function as the "fixed-increment" adaptive method. With this formulation, as with the adaptive methods, weights which tend to minimize the number of classification errors are computed for both separable and nonseparable pattern sets, and not just for separable pattern sets as has been the emphasis in previous linear programming formulations.Keywords
This publication has 6 references indexed in Scilit:
- The use of an adaptive threshold element to design a linear optimal pattern classifierIEEE Transactions on Information Theory, 1966
- Linear and Nonlinear Separation of Patterns by Linear ProgrammingOperations Research, 1965
- Lower Bounds of the Number of Threshold Functions and a Maximum WeightIEEE Transactions on Electronic Computers, 1965
- The Boundary Matrix of Threshold FunctionsIEEE Transactions on Electronic Computers, 1965
- Effects of Adaptation Parameters on Convergence Time and Tolerance for Adaptive Threshold ElementsIEEE Transactions on Electronic Computers, 1964
- Linear-Input LogicIEEE Transactions on Electronic Computers, 1961