Author
Listed:
- Usama Arshad
(Ghulam Ishaq Khan Institute of Engineering Sciences and Technology)
- Gohar Khan
(Zayed University)
- Fawaz Khaled Alarfaj
(King Faisal University)
- Zahid Halim
(Ghulam Ishaq Khan Institute of Engineering Sciences and Technology
National Yunlin University of Science and Technology)
- Sajid Anwar
(Institute of Management Sciences)
Abstract
Customer churn prediction is important for businesses, especially in the telecommunications sector, where retaining customers is more cost-effective than acquiring new ones. Traditional ensemble learning methods have enhanced prediction accuracy by combining multiple models, but they often struggle with efficiently processing complex, high-dimensional data. This paper introduces Q-Ensemble Learning, a novel approach integrating Quantum Computing (QC) with ensemble techniques to improve predictive performance. Our framework incorporates quantum algorithms such as Quantum Support Vector Machine (Q SVM), Quantum k-Nearest Neighbors (Q k-NN), Quantum Decision Tree (QDT), and others into an ensemble, leveraging their superior computational capabilities. The predictions from each quantum classifier are aggregated using a consensus voting mechanism and recorded on a blockchain to ensure robust data transparency and security. Extensive experiments on publicly available telecom customer churn datasets demonstrate that Q-Ensemble Learning improves accuracy by 15%, precision by 12%, and recall by 10% compared to classical ensemble methods such as Random Forest and Gradient Boosting. These metrics highlight the framework’s effectiveness in reducing false positives and negatives, significantly enhancing the reliability of churn prediction. The blockchain integration further ensures that the data handling process is transparent and secure, building trust in the model’s decisions.
Suggested Citation
Usama Arshad & Gohar Khan & Fawaz Khaled Alarfaj & Zahid Halim & Sajid Anwar, 2025.
"Q-ensemble learning for customer churn prediction with blockchain-enabled data transparency,"
Annals of Operations Research, Springer, vol. 353(2), pages 607-633, October.
Handle:
RePEc:spr:annopr:v:353:y:2025:i:2:d:10.1007_s10479-024-06346-1
DOI: 10.1007/s10479-024-06346-1
Download full text from publisher
As the access to this document is restricted, you may want to
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:spr:annopr:v:353:y:2025:i:2:d:10.1007_s10479-024-06346-1. 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: 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.