IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v1y2010i1p57-80.html
   My bibliography  Save this article

Linear Programming Approaches for Multiple-Class Discriminant and Classification Analysis

Author

Listed:
  • Minghe Sun

    (University of Texas at San Antonio, USA)

Abstract

New linear programming approaches are proposed as nonparametric procedures for multiple-class discriminant and classification analysis. A new MSD model minimizing the sum of the classification errors is formulated to construct discriminant functions. This model has desirable properties because it is versatile and is immune to the pathologies of some of the earlier mathematical programming models for two-class classification. It is also purely systematic and algorithmic and no user ad hoc and trial judgment is required. Furthermore, it can be used as the basis to develop other models, such as a multiple-class support vector machine and a mixed integer programming model, for discrimination and classification. A MMD model minimizing the maximum of the classification errors, although with very limited use, is also studied. These models may also be considered as generalizations of mathematical programming formulations for two-class classification. By the same approach, other mathematical programming formulations for two-class classification can be easily generalized to multiple-class formulations. Results on standard as well as randomly generated test datasets show that the MSD model is very effective in generating powerful discriminant functions.

Suggested Citation

  • Minghe Sun, 2010. "Linear Programming Approaches for Multiple-Class Discriminant and Classification Analysis," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 1(1), pages 57-80, January.
  • Handle: RePEc:igg:jsds00:v:1:y:2010:i:1:p:57-80
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jsds.2010103004
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jsds00:v:1:y:2010:i:1:p:57-80. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.