IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v272y2019i3p1041-1057.html
   My bibliography  Save this article

A comparative study of the leading machine learning techniques and two new optimization algorithms

Author

Listed:
  • Baumann, P.
  • Hochbaum, D.S.
  • Yang, Y.T.

Abstract

We present here a computational study comparing the performance of leading machine learning techniques to that of recently developed graph-based combinatorial optimization algorithms (SNC and KSNC). The surprising result of this study is that SNC and KSNC consistently show the best or close to best performance in terms of their F1-scores, accuracy, and recall. Furthermore, the performance of SNC and KSNC is considerably more robust than that of the other algorithms; the others may perform well on average but tend to vary greatly across data sets. This demonstrates that combinatorial optimization techniques can be competitive as compared to state-of-the-art machine learning techniques. The code developed for SNC and KSNC is publicly available.

Suggested Citation

  • Baumann, P. & Hochbaum, D.S. & Yang, Y.T., 2019. "A comparative study of the leading machine learning techniques and two new optimization algorithms," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1041-1057.
    • Handle: RePEc:eee:ejores:v:272:y:2019:i:3:p:1041-1057
    DOI: 10.1016/j.ejor.2018.07.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718306143
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.07.009?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.

    References listed on IDEAS

    as
    1. Nesreen Ahmed & Amir Atiya & Neamat El Gayar & Hisham El-Shishiny, 2010. "An Empirical Comparison of Machine Learning Models for Time Series Forecasting," Econometric Reviews, Taylor & Francis Journals, vol. 29(5-6), pages 594-621.
    2. Carrizosa, Emilio & Martín-Barragán, Belén & Morales, Dolores Romero, 2011. "Detecting relevant variables and interactions in supervised classification," European Journal of Operational Research, Elsevier, vol. 213(1), pages 260-269, August.
    3. Dorit S. Hochbaum, 2008. "The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem," Operations Research, INFORMS, vol. 56(4), pages 992-1009, August.
    4. Young U. Ryu & R. Chandrasekaran & Varghese Jacob, 2004. "Prognosis Using an Isotonic Prediction Technique," Management Science, INFORMS, vol. 50(6), pages 777-785, June.
    5. Arno de Caigny & Kristof Coussement & Koen W. de Bock, 2018. "A new hybrid classification algorithm for customer churn prediction based on logistic regression and decision trees," Post-Print hal-01741661, HAL.
    6. De Caigny, Arno & Coussement, Kristof & De Bock, Koen W., 2018. "A new hybrid classification algorithm for customer churn prediction based on logistic regression and decision trees," European Journal of Operational Research, Elsevier, vol. 269(2), pages 760-772.
    7. Pedro Duarte Silva, A., 2017. "Optimization approaches to Supervised Classification," European Journal of Operational Research, Elsevier, vol. 261(2), pages 772-788.
    8. Hochbaum, Dorit S., 2002. "Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations," European Journal of Operational Research, Elsevier, vol. 140(2), pages 291-321, July.
    9. Dorit S. Hochbaum, 2013. "A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant," Operations Research, INFORMS, vol. 61(1), pages 184-198, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Roberto Asín Achá & Dorit S. Hochbaum & Quico Spaen, 2020. "HNCcorr: combinatorial optimization for neuron identification," Annals of Operations Research, Springer, vol. 289(1), pages 5-32, June.
    2. Bogaert, Matthias & Lootens, Justine & Van den Poel, Dirk & Ballings, Michel, 2019. "Evaluating multi-label classifiers and recommender systems in the financial service sector," European Journal of Operational Research, Elsevier, vol. 279(2), pages 620-634.
    3. Marc Gürtler & Marvin Zöllner, 2023. "Heterogeneities among credit risk parameter distributions: the modality defines the best estimation method," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 251-287, March.
    4. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Roberto Asín Achá & Dorit S. Hochbaum & Quico Spaen, 2020. "HNCcorr: combinatorial optimization for neuron identification," Annals of Operations Research, Springer, vol. 289(1), pages 5-32, June.
    2. Chou, Ping & Chuang, Howard Hao-Chun & Chou, Yen-Chun & Liang, Ting-Peng, 2022. "Predictive analytics for customer repurchase: Interdisciplinary integration of buy till you die modeling and machine learning," European Journal of Operational Research, Elsevier, vol. 296(2), pages 635-651.
    3. Koen W. de Bock & Arno de Caigny, 2021. "Spline-rule ensemble classifiers with structured sparsity regularization for interpretable customer churn modeling," Post-Print hal-03391564, HAL.
    4. Louis Geiler & Séverine Affeldt & Mohamed Nadif, 2022. "A survey on machine learning methods for churn prediction," Post-Print hal-03824873, HAL.
    5. Matthias Bogaert & Lex Delaere, 2023. "Ensemble Methods in Customer Churn Prediction: A Comparative Analysis of the State-of-the-Art," Mathematics, MDPI, vol. 11(5), pages 1-28, February.
    6. De Caigny, Arno & Coussement, Kristof & De Bock, Koen W. & Lessmann, Stefan, 2020. "Incorporating textual information in customer churn prediction models based on a convolutional neural network," International Journal of Forecasting, Elsevier, vol. 36(4), pages 1563-1578.
    7. Youngkeun Choi & Jae W. Choi, 2023. "Assessing the Predictive Performance of Machine Learning in Direct Marketing Response," International Journal of E-Business Research (IJEBR), IGI Global, vol. 19(1), pages 1-12, January.
    8. Arno de Caigny & Kristof Coussement & Koen de Bock, 2020. "Leveraging fine-grained transaction data for customer life event predictions," Post-Print hal-02507998, HAL.
    9. Chen, Yan & Zhang, Lei & Zhao, Yulu & Xu, Bing, 2022. "Implementation of penalized survival models in churn prediction of vehicle insurance," Journal of Business Research, Elsevier, vol. 153(C), pages 162-171.
    10. Dumitrescu, Elena & Hué, Sullivan & Hurlin, Christophe & Tokpavi, Sessi, 2022. "Machine learning for credit scoring: Improving logistic regression with non-linear decision-tree effects," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1178-1192.
    11. Narendra Singh & Pushpa Singh & Mukul Gupta, 2020. "An inclusive survey on machine learning for CRM: a paradigm shift," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 47(4), pages 447-457, December.
    12. Ni, Ji & Chen, Bowei & Allinson, Nigel M. & Ye, Xujiong, 2020. "A hybrid model for predicting human physical activity status from lifelogging data," European Journal of Operational Research, Elsevier, vol. 281(3), pages 532-542.
    13. Lewlisa Saha & Hrudaya Kumar Tripathy & Tarek Gaber & Hatem El-Gohary & El-Sayed M. El-kenawy, 2023. "Deep Churn Prediction Method for Telecommunication Industry," Sustainability, MDPI, vol. 15(5), pages 1-21, March.
    14. Wen Zhang & Andrew Dunkley & Urvi Kanabar & David Elliott & Henry P. Wynn, 2022. "A decision support system for liability in civil litigation: a case study from an insurance company," Annals of Operations Research, Springer, vol. 315(2), pages 695-706, August.
    15. Andreea Dumitrache & Monica Mihaela Maer Matei, 2019. "Churn Analysis in a Romanian Telecommunications Company," Postmodern Openings, Editura Lumen, Department of Economics, vol. 10(4), pages 44-53, December.
    16. Tianyuan Zhang & Sérgio Moro & Ricardo F. Ramos, 2022. "A Data-Driven Approach to Improve Customer Churn Prediction Based on Telecom Customer Segmentation," Future Internet, MDPI, vol. 14(3), pages 1-19, March.
    17. Ebru Pekel Ozmen & Tuncay Ozcan, 2022. "A novel deep learning model based on convolutional neural networks for employee churn prediction," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 41(3), pages 539-550, April.
    18. Borchert, Philipp & Coussement, Kristof & De Caigny, Arno & De Weerdt, Jochen, 2023. "Extending business failure prediction models with textual website content using deep learning," European Journal of Operational Research, Elsevier, vol. 306(1), pages 348-357.
    19. Lamrhari, Soumaya & Ghazi, Hamid El & Oubrich, Mourad & Faker, Abdellatif El, 2022. "A social CRM analytic framework for improving customer retention, acquisition, and conversion," Technological Forecasting and Social Change, Elsevier, vol. 174(C).
    20. Koen W. de Bock & Kristof Coussement & Arno De Caigny & Roman Slowiński & Bart Baesens & Robert N Boute & Tsan-Ming Choi & Dursun Delen & Mathias Kraus & Stefan Lessmann & Sebastián Maldonado & David , 2023. "Explainable AI for Operational Research: A Defining Framework, Methods, Applications, and a Research Agenda," Post-Print hal-04219546, HAL.

    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:ejores:v:272:y:2019:i:3:p:1041-1057. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.elsevier.com/locate/eor .

    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.