IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v236y2025icp29-51.html
   My bibliography  Save this article

Prediction of breast cancer using metaheuristic-driven ensemble learning: A novel classification approach

Author

Listed:
  • Yang, Zheng
  • Zhou, Rui
  • Qu, HuaiRong
  • Liu, Liang
  • Wu, QingBin

Abstract

Breast cancer remains one of the most common cancers among women, with a high mortality rate. Early diagnosis is crucial for effective treatment and prevention. This study introduces an innovative approach to breast cancer prediction, integrating Support Vector Classification and Histogram Gradient Boosting Classification models with a novel ensemble method using bagging. To further enhance predictive accuracy, three new metaheuristic optimization algorithms (Mother Optimization Algorithm, Osprey Optimization Algorithm, and Puma Optimization Algorithm) are employed. The study rigorously applies feature selection techniques and k-fold cross-validation to ensure optimal results. The novelty lies in the cooperative use of these reliable classification models with advanced metaheuristic optimizers and an ensemble strategy, leading to superior performance in breast cancer prediction. The Boosting Algorithm Puma Optimization Algorithm model, optimized with the Puma Optimization Algorithm, achieved exceptional classification performance, with 0.9606 for malignant cases and 0.9760 for benign cases, supported by an Metahueristic Algorithm Classification of 0.9368. This demonstrates the model's high accuracy and reliability in clinical diagnosis, making a significant contribution to healthcare by optimizing machine learning models for more accurate and trustworthy predictions.

Suggested Citation

  • Yang, Zheng & Zhou, Rui & Qu, HuaiRong & Liu, Liang & Wu, QingBin, 2025. "Prediction of breast cancer using metaheuristic-driven ensemble learning: A novel classification approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 236(C), pages 29-51.
  • Handle: RePEc:eee:matcom:v:236:y:2025:i:c:p:29-51
    DOI: 10.1016/j.matcom.2025.03.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425000989
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.03.025?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.

    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:eee:matcom:v:236:y:2025:i:c:p:29-51. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.