IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v38y2021i1d10.1007_s00357-020-09362-5.html
   My bibliography  Save this article

A New Performance Evaluation Metric for Classifiers: Polygon Area Metric

Author

Listed:
  • Onder Aydemir

    (Karadeniz Technical University)

Abstract

Classifier performance assessment (CPA) is a challenging task for pattern recognition. In recent years, various CPA metrics have been developed to help assess the performance of classifiers. Although the classification accuracy (CA), which is the most popular metric in pattern recognition area, works well if the classes have equal number of samples, it fails to evaluate the recognition performance of each class when the classes have different number of samples. To overcome this problem, researchers have developed various metrics including sensitivity, specificity, area under curve, Jaccard index, Kappa, and F-measure except CA. Giving many evaluation metrics for assessing the performance of classifiers make large tables possible. Additionally, when comparing classifiers with each other, while a classifier might be more successful on a metric, it may have poor performance for the other metrics. Hence, such kinds of situations make it difficult to track results and compare classifiers. This study proposes a stable and profound knowledge criterion that allows the performance of a classifier to be evaluated with only a single metric called as polygon area metric (PAM). Thus, classifier performance can be easily evaluated without the need for several metrics. The stability and validity of the proposed metric were tested with the k-nearest neighbor, support vector machines, and linear discriminant analysis classifiers on a total of 7 different datasets, five of which were artificial. The results indicate that the proposed PAM method is simple but effective for evaluating classifier performance.

Suggested Citation

  • Onder Aydemir, 2021. "A New Performance Evaluation Metric for Classifiers: Polygon Area Metric," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 16-26, April.
  • Handle: RePEc:spr:jclass:v:38:y:2021:i:1:d:10.1007_s00357-020-09362-5
    DOI: 10.1007/s00357-020-09362-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-020-09362-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00357-020-09362-5?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.

    References listed on IDEAS

    as
    1. Seong Jae Kim & Kyong Jin Cho & Sejong Oh, 2017. "Development of machine learning models for diagnosis of glaucoma," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-16, May.
    2. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mac Cawley, Alejandro & Maturana, Sergio & Pascual, Rodrigo & Tortorella, Guilherme Luz, 2022. "Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: Robust formulation and a decomposition solution approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 819-839.
    2. Shaojun Lu & Jun Pei & Xinbao Liu & Xiaofei Qian & Nenad Mladenovic & Panos M. Pardalos, 2020. "Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing," Journal of Scheduling, Springer, vol. 23(6), pages 649-664, December.
    3. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    4. Fernandez-Viagas, Victor & Talens, Carla & Framinan, Jose M., 2022. "Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 869-882.
    5. Zhang, Sicheng & Li, Xiang & Zhang, Bowen & Wang, Shouyang, 2020. "Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system," European Journal of Operational Research, Elsevier, vol. 283(2), pages 441-460.
    6. Chin-Chia Wu & Jatinder N. D. Gupta & Win-Chin Lin & Shuenn-Ren Cheng & Yen-Lin Chiu & Juin-Han Chen & Long-Yuan Lee, 2022. "Robust Scheduling of Two-Agent Customer Orders with Scenario-Dependent Component Processing Times and Release Dates," Mathematics, MDPI, vol. 10(9), pages 1-17, May.
    7. Zikai Zhang & Qiuhua Tang, 2022. "Integrating preventive maintenance to two-stage assembly flow shop scheduling: MILP model, constructive heuristics and meta-heuristics," Flexible Services and Manufacturing Journal, Springer, vol. 34(1), pages 156-203, March.
    8. Ren-Xia Chen & Shi-Sheng Li, 2020. "Minimizing maximum delivery completion time for order scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1044-1064, November.
    9. Michelle Viscaino & Juan C Maass & Paul H Delano & Mariela Torrente & Carlos Stott & Fernando Auat Cheein, 2020. "Computer-aided diagnosis of external and middle ear conditions: A machine learning approach," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-18, 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:jclass:v:38:y:2021:i:1:d:10.1007_s00357-020-09362-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.