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

A new machine learning approach to optimize correlated biomarkers

Author

Listed:
  • Ya-Hsun Lee
  • Yi-Hau Chen
  • Chao-Yu Guo

Abstract

The number of novel biomarkers is booming. However, a simple predictive score is more feasible to evaluate the clinical outcome and provide better accuracy. However, the optimal linear combination of correlated biomarkers demands comprehensive methodological research. This research aims to develop a novel approach for interpretable optimization. This research proposes the gradient boost machine with the Youden Index (GBYI) as the target function. The rationale is that the gradient boost machine demonstrates superior prediction ability and provides excellent interpretations according to the linear model. In addition, the Youden Index could effortlessly estimate the optimal cutoff point of the diagnostic test and evaluate the overall accuracy. Simulation studies evaluate the performance of the GBYI with linear and nonlinear structured datasets. We also demonstrate an application in the Bupa Liver Disease Data, which revealed that our optimal combination of correlated biomarkers shows an improved prediction with higher accuracy. This research proposes a novel machine-learning strategy using the powerful statistical boosting technique of the Youden Index. The new machine could optimize the combination of high-dimensional data and provide attractive interpretable coefficients.

Suggested Citation

  • Ya-Hsun Lee & Yi-Hau Chen & Chao-Yu Guo, 2025. "A new machine learning approach to optimize correlated biomarkers," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(23), pages 7515-7526, December.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:23:p:7515-7526
    DOI: 10.1080/03610926.2025.2477289
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2025.2477289?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:23:p:7515-7526. 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.