IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2025i19p6231-6248.html
   My bibliography  Save this article

A comparison between penalized logistic regressions and classification tree approaches

Author

Listed:
  • Mostafa Behzadi
  • Rossita Mohamad Yunus
  • Saharuddin Bin Mohamad
  • Nor Aishah Hamzah

Abstract

The penalized models have been established to be necessary for classifying the emerging complex, high-dimensional datasets. One of these penalized models is the “modified elastic-net” (M-Enet). The special cases of M-Enet (ridge, bridge, Lasso, and elastic-net) can be produced based on its penalty function. By using the fact that the Fisher-Scoring (FS) and Newton-Raphson (NR) algorithms use different approaches to solve numerical problems but are the same in the canonical link, in order to ease implementation, we developed an FS algorithm for the computation of the parameter estimates of the M-Enet. A simulation study of the microbiome as complex, high-dimensional data shows that each special case of the M-Enet penalty function has superiority in the sense of model accuracy, sensitivity, and feature selection technique. A comparison study is performed between the classification of binary responses using M-Enet as a parametric method and the classification tree via “GUIDE” as a non parametric method. The statistical analysis of the numerical results reveals that the special cases of M-Enet models outperform other M-Enet models and GUIDE in terms of average prediction accuracy and sensitivity, with p-values of 0. 0362 and 0. 0214, respectively. Consequently, these models exhibit superior classification performance compared to other classifier models.

Suggested Citation

  • Mostafa Behzadi & Rossita Mohamad Yunus & Saharuddin Bin Mohamad & Nor Aishah Hamzah, 2025. "A comparison between penalized logistic regressions and classification tree approaches," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(19), pages 6231-6248, October.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:19:p:6231-6248
    DOI: 10.1080/03610926.2025.2450779
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2025.2450779
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2025.2450779?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

    for a different version of it.

    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:taf:lstaxx:v:54:y:2025:i:19:p:6231-6248. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.