IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v74y1997i0p89-11210.1023-a1018995010063.html
   My bibliography  Save this article

Mathematical programming formulations for two-group classification with binary variables

Author

Listed:
  • Ognian Asparoukhov
  • Antonie Stam

Abstract

In this paper, we introduce a nonparametric mathematical programming (MP) approach for solving the binary variable classification problem. In practice, there exists a substantial interest in the binary variable classification problem. For instance, medical diagnoses are often based on the presence or absence of relevant symptoms, and binary variable classification has long been used as a means to predict (diagnose) the nature of the medical condition of patients. Our research is motivated by the fact that none of the existing statistical methods for binary variable classification, parametric and nonparametric alike, are fully satisfactory. The general class of MP classification methods facilitates a geometric interpretation, and MP-based classification rules have intuitive appeal because of their potentially robust properties. These intuitive arguments appear to have merit, and a number of research studies have confirmed that MP methods can indeed yield effective classification rules under certain non-normal data conditions, for instance if the data set is outlier-contaminated or highly skewed. However, the MP-based approach in general lacks a probabilistic foundation, necessitating an ad hoc assessment of its classification performance. Our proposed nonparametric mixed integer programming (MIP) formulation for the binary variable classification problem not only has a geometric interpretation, but also is Bayes inspired. Therefore, our proposed formulation possesses a strong probabilistic foundation. We also introduce a linear programming (LP) formulation which parallels the concepts underlying the MIP formulation, but does not possess the decision theoretic justification. An additional advantage of both our LP and MIP formulations is that, due to the fact that the attribute variables are binary, the training sample observations can be partitioned into multinomial cells, allowing for a substantial reduction in the number of binary and deviational variables, so that our formulation can be used to analyze training samples of almost any size. We illustrate our formulations using an example problem, and use three real data sets to compare its classification performance with a variety of parametric and non-parametric statistical methods. For each of these data sets, our proposed formulation yields the minimum possible number of misclassifications, both using the resubstitution and the Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Ognian Asparoukhov & Antonie Stam, 1997. "Mathematical programming formulations for two-group classification with binary variables," Annals of Operations Research, Springer, vol. 74(0), pages 89-112, November.
  • Handle: RePEc:spr:annopr:v:74:y:1997:i:0:p:89-112:10.1023/a:1018995010063
    DOI: 10.1023/A:1018995010063
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018995010063
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1018995010063?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Asparoukhov, Ognian K. & Krzanowski, Wojtek J., 2001. "A comparison of discriminant procedures for binary variables," Computational Statistics & Data Analysis, Elsevier, vol. 38(2), pages 139-160, December.
    2. Pedro Duarte Silva, A., 2017. "Optimization approaches to Supervised Classification," European Journal of Operational Research, Elsevier, vol. 261(2), pages 772-788.
    3. Parag Pendharkar & Marvin Troutt, 2014. "Interactive classification using data envelopment analysis," Annals of Operations Research, Springer, vol. 214(1), pages 125-141, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:74:y:1997:i:0:p:89-112:10.1023/a:1018995010063. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.