IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1059-d1619544.html
   My bibliography  Save this article

Optimizing Accuracy, Recall, Specificity, and Precision Using ILP

Author

Listed:
  • Arash Marioriyad

    (Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran)

  • Pouria Ramazi

    (Department of Mathematics and Statistics, Brock University, St. Catharines, ON L2S 3A1, Canada)

Abstract

Accuracy, recall, specificity, and precision are key performance measures for binary classifiers. To obtain these measures, the probabilities generated by classifiers must be converted into deterministic labels using a threshold. Exhaustive search methods can be computationally expensive, prompting the need for a more efficient solution. We propose an integer linear programming (ILP) formulation to find the threshold that maximizes any linear combination of these measures. Simulations and experiments on four real-world datasets demonstrate that our approach identifies the optimal threshold orders of magnitude faster than an exhaustive search. This work establishes ILP as an efficient tool for optimizing classifier performance.

Suggested Citation

  • Arash Marioriyad & Pouria Ramazi, 2025. "Optimizing Accuracy, Recall, Specificity, and Precision Using ILP," Mathematics, MDPI, vol. 13(7), pages 1-12, March.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1059-:d:1619544
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1059/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/7/1059/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:7:p:1059-:d:1619544. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.