Pattern Classifier Design by Linear Programming

Authors:
F. W. Smith
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1968

Citing 0
Cited 19

Original Contribution: A polynomial time algorithm for the construction and training of a class of multilayer perceptrons

Neural Networks
The Accelerated Relaxation Method for Linear Inequalities

IEEE Transactions on Computers
Solution of Linear Inequalities

IEEE Transactions on Computers
Decision-Directed Estimation of a Two-Class Decision Boundary

IEEE Transactions on Computers
Comment on "Pattern Classification Design by Linear Programming"

IEEE Transactions on Computers
An Algorithm for the Solution of Linear Inequalities

IEEE Transactions on Computers
An Algorithm for Pattern Classification Using Eigenvectors

IEEE Transactions on Computers
Design of Multicategory Pattern Classifiers with Two-Category Classifier Design Procedures

IEEE Transactions on Computers
On a Method of Sequential Pattern Recognition

IEEE Transactions on Computers
An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition

IEEE Transactions on Computers
An expert system for detection of breast cancer based on association rules and neural network

Expert Systems with Applications: An International Journal
A new feature selection method based on association rules for diagnosis of erythemato-squamous diseases

Expert Systems with Applications: An International Journal
Using Supervised Complexity Measures in the Analysis of Cancer Gene Expression Data Sets

BSB '09 Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Domains of competence of fuzzy rule based classification systems with data complexity measures: A case of study using a fuzzy hybrid genetic based machine learning method

Fuzzy Sets and Systems
Analysis of complexity indices for classification problems: Cancer gene expression data

Neurocomputing
Shared domains of competence of approximate learning models using measures of separability of classes

Information Sciences: an International Journal
Predicting noise filtering efficacy with data complexity measures for nearest neighbor classification

Pattern Recognition
Peer-to-peer distributed text classifier learning in PADMINI

Statistical Analysis and Data Mining
Analysis of data complexity measures for classification

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	15.01

Visualization

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.