Mathematical Programming Methods of Pattern Classification

Published Online:https://doi.org/10.1287/mnsc.19.3.272

This survey examines eight mathematical programming models of pattern classification. The paper determines the range of applicability and computational merits of each model. The flexibility and large sample properties of the models are also discussed. We find that six of the models produce decision rules that maximize a function we call the quality of a decision rule. The remaining two models minimize a weighted sum of errors.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.