IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i3d10.1007_s12597-024-00852-3.html
   My bibliography  Save this article

Selecting the best way to forecast income in the banking industry using data mining methods, a case study

Author

Listed:
  • Alireza Jafari

    (University of Tehran)

  • Amir Aghsami

    (University of Tehran
    Ankara Yıldırım Beyazıt University)

  • Masoud Rabbani

    (University of Tehran)

Abstract

One of the most important topics in data science is the prediction topic. The prediction accuracy is often sought after in many articles, aiming to establish trust in the prediction results. Customer revenue prediction is deemed crucial in any industry, as awareness of future income allows for strategic development across various industry sectors. Traditionally, profits and losses were assessed retrospectively following a business event. However, today, future revenue can be predicted using data science concepts. Future revenue prediction can be achieved through the application of different types of data mining algorithms, each possessing its level of accuracy. In this article, the forecasting of bank customers’ revenue will be examined using various algorithms. To this end, different forecasting methods such as regression, decision tree, random forest, cart, etc., will be implemented, both with and without clustering, to identify the optimal approach for predicting customer revenue.

Suggested Citation

  • Alireza Jafari & Amir Aghsami & Masoud Rabbani, 2025. "Selecting the best way to forecast income in the banking industry using data mining methods, a case study," OPSEARCH, Springer;Operational Research Society of India, vol. 62(3), pages 1383-1422, September.
  • Handle: RePEc:spr:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00852-3
    DOI: 10.1007/s12597-024-00852-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00852-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12597-024-00852-3?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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00852-3. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.