IDEAS home Printed from
   My bibliography  Save this article

Evaluation Of Classification Algorithms Using Mcdm And Rank Correlation



    (School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, 610054, P. R. China)


    (School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, 610054, P. R. China)


    (School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, 610054, P. R. China)


    (College of Information Science & Technology, University of Nebraska at Omaha, Omaha, NE 68182, USA;
    CAS Research Center on Fictitious Economy and Data Sciences, Beijing 100080, China)


Classification algorithm selection is an important issue in many disciplines. Since it normally involves more than one criterion, the task of algorithm selection can be modeled as multiple criteria decision making (MCDM) problems. Different MCDM methods evaluate classifiers from different aspects and thus they may produce divergent rankings of classifiers. The goal of this paper is to propose an approach to resolve disagreements among MCDM methods based on Spearman's rank correlation coefficient. Five MCDM methods are examined using 17 classification algorithms and 10 performance criteria over 11 public-domain binary classification datasets in the experimental study. The rankings of classifiers are quite different at first. After applying the proposed approach, the differences among MCDM rankings are largely reduced. The experimental results prove that the proposed approach can resolve conflicting MCDM rankings and reach an agreement among different MCDM methods.

Suggested Citation

  • Gang Kou & Yanqun Lu & Yi Peng & Yong Shi, 2012. "Evaluation Of Classification Algorithms Using Mcdm And Rank Correlation," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 11(01), pages 197-225.
  • Handle: RePEc:wsi:ijitdm:v:11:y:2012:i:01:n:s0219622012500095
    DOI: 10.1142/S0219622012500095

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers

    File URL:
    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.


    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:wsi:ijitdm:v:11:y:2012:i:01:n:s0219622012500095. 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: Tai Tone Lim (email available below). General contact details of provider: .

    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.