IDEAS home Printed from https://ideas.repec.org/a/wly/jforec/v45y2026i1p260-271.html

Multi‐Classifier Evidence Ensemble Algorithm‐Based for Predicting Travelers Repurchases of China's Airlines

Author

Listed:
  • Yanhong Chen
  • Luning Liu
  • Dequan Zheng

Abstract

Repurchase prediction is a vital aspect of marketing strategy and a complex decision‐making task, especially in the airline industry, where data are uncertain, incomplete, and ambiguous. To address this, this study proposes a novel multi‐classifier evidence ensemble algorithm that integrates evidence theory with machine learning to predict travelers' repurchase behavior. The model was trained using 29 behavioral features derived from a low‐cost Chinese airline. Empirical results show that the proposed algorithm outperforms traditional models in terms of the accuracy, the precision, the recall, the F1‐score, and the AUC. Specifically, it achieved over 80% accuracy and precision in binary classification tasks. Ablation experiments using four classifier combinations at different sampling rates (30%, 50%, and 70%) further validated the robustness and effectiveness of the framework. The results suggest that the proposed ensemble framework outperforms traditional prediction models in terms of overall predictive performance for analyzing airline passenger behavior in real‐world settings.

Suggested Citation

  • Yanhong Chen & Luning Liu & Dequan Zheng, 2026. "Multi‐Classifier Evidence Ensemble Algorithm‐Based for Predicting Travelers Repurchases of China's Airlines," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 45(1), pages 260-271, January.
  • Handle: RePEc:wly:jforec:v:45:y:2026:i:1:p:260-271
    DOI: 10.1002/for.70026
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/for.70026
    Download Restriction: no

    File URL: https://libkey.io/10.1002/for.70026?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
    ---><---

    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:wly:jforec:v:45:y:2026:i:1:p:260-271. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www3.interscience.wiley.com/cgi-bin/jhome/2966 .

    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.