Skip to main content
Log in

Calculating the required cash in bank branches: a Bayesian-data mining approach

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

The issue of sufficiency of cash in bank branches is considered as an important issue especially for branch managers; because, not only the insufficiency of daily cash results in lack of response to needs of customers, but also may its excess result in increase in costs for banks. Hence, banks are always attempting to determine their required cash based on their daily operation. For this purpose, in this paper, 18 branches of a certain bank in a period of five months, due to diversity of the branches, have been classified by two methods of hierarchical clustering and Bayesian hierarchical clustering in similar clusters, and then by considering the results obtained from clustering, amounts of entered and consumed branch cash have been estimated by neural network (via classic and Bayesian approach), so that the cash required by branches can be calculated. The error criteria of the estimates show that calculations by applying Bayesian neural network method with considering Bayesian clustering have the least error compared to other methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Adendorff S, Kruger P (2000) A decision support model for the cash replenishment process in South African retail banking. J Ind Eng 11:1944–1961

    Google Scholar 

  2. Bernardo JM, Giron J (1988) A Bayesain approach to cluster analysis. Questiio 12:97–112

    MATH  Google Scholar 

  3. Bioch JC, Meer O, Potharst R (1995) Classification using Bayesian Neural Nets. In: IEEE international conference on neural networks, Technical Report, eur-cs-95-09

  4. Blomstedt P, Tang J, Xiong J, Granlund Ch, Corander J (2015) A Bayesian predictive model for clustering data of mixed discrete and continuous type. IEEE Trans Pattern Anal Mach Intell 37:489–498

    Article  Google Scholar 

  5. Cardona L, Amaya ML (2012) Cash management cost reduction using data mining to forecast cash demand and LP to optimize resources. Memet Comput 4:127–134

    Article  Google Scholar 

  6. Foresee D, Hagan F (1997) Gauss-Newton approximation to Bayesian learning. In: International conference on neural networks

  7. Franzen J (2008) Bayesain cluster Analysis. Ph.D. Diss., Department of statistics, Stockholm University

  8. Gower J (1966) Some distance properties of latent root and vector methods used in multivariate analysis. Bio Metrics 53:315–328

    MathSciNet  MATH  Google Scholar 

  9. Gower J (1971) A general coefficient of similarity and some of its properties. Bio Metrics 27:857–874

    Google Scholar 

  10. Heard AN, Holmes ChC, Stephens A (2006) A quantitative study of gene regulation involved in the immune response of anopheline mosquitoes: an application of bayesian hierarchical clustering of curves. J Am Stat Assoc 101(473):18–29

    Article  MathSciNet  Google Scholar 

  11. Heller KA, Ghahramani Z (2005) Bayesian hierarchical clustering. In: Twenty-second international conference on machine learning

  12. Kauffman L, Rousseeuw P (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York

    Book  Google Scholar 

  13. Lampinen J, Vehtari A (2001) Bayesian techniques for neural networks, review and case studies. Neural Netw 14:7–24

    Article  Google Scholar 

  14. MacKay DJC (1992) Information-based objective functions for active data selection. Neural Comput 4:590–604

    Article  Google Scholar 

  15. Neal R (1995) Bayesian learning for neural networks. Ph.D. Diss., Graduate Department of Computer Science, University of Toronto

  16. Olson DL, Delen D (2008) Advanced data mining techniques. Springer, Heidelberg

    MATH  Google Scholar 

  17. Partovi Nia V (2009) Fast high-dimensional Bayesian classification and clustering. Ph.D. Diss., Ecole Polytechnique Federale de Lasuanne

  18. Penny WD, Roberts SJ (1999) Bayesian neural networks for classification: how useful is the evidence framework? Neural Netw 12:877–892

    Article  Google Scholar 

  19. Premchand K, Walia E (2006) Cash forecasting: an application of artificial neural networks in finance. J Comput Sci Appl 3:61–77

    Google Scholar 

  20. Sandipan R (2010) Determining optimal cash allocation at ICICI bank branches. ICICI Bank, SAS Global Forum, Mumbai

    Google Scholar 

  21. Thodberg H (1996) A review of Bayesian neural networks with an application to near infrared spectroscopy. IEEE Trans Neural Netw 7:56–72

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Farzad Eskandari.

Ethics declarations

Conflict of interest

The authors declare that there is no potential conflict of interest.

Appendix

Appendix

Expanding (6) and considering hyperparameters, the density function for the weight according to Bayes’ theorem is as follow:

$$ P(w|D,\alpha ,\beta ,F) = \frac{P(D|w,\beta ,F)P(w|\alpha ,F)}{P(D|\alpha ,\beta ,F)} $$

Also, the probability densities are:

$$ \begin{aligned} P(D|w,\beta ,F) & = \frac{1}{{Z_{D} (\beta )}}\exp ( - \beta E_{D} ) \\ P(w|\alpha ,F) & = \frac{1}{{Z_{W} (\alpha )}}\exp ( - \alpha E_{W} ) \\ \end{aligned} $$
$$ Z_{D} (\beta ) = (\pi /\beta )^{N/2} ,\quad Z_{W} (\alpha ) = (\pi /\alpha )^{W/2} $$

Replacing the above probabilities into the first one and knowing that \( P(D|\alpha ,\beta ,F) \) is normalization factor, will have:

$$ P(w|D,\alpha ,\beta ,F) = \frac{1}{{Z_{M} (\alpha ,\beta )}}\exp ( - M(w)) $$

So, it will be obtained:

$$ \begin{aligned} P(D|\alpha ,\beta ,F) & = \frac{P(D|w,\beta ,F)P(w|\alpha ,F)}{P(w|D,\alpha ,\beta ,F)} \\ & = \frac{{\left[ {\frac{1}{{Z_{D} (\beta )}}\exp ( - \beta E_{D} )} \right]\left[ {\frac{1}{{Z_{W} (\alpha )}}\exp ( - \alpha E_{W} )} \right]}}{{\frac{1}{{Z_{M} (\alpha ,\beta )}}\exp ( - M(w))}} \\ & \quad \frac{{Z_{M} (\alpha ,\beta )}}{{Z_{D} (\beta )Z_{W} (\alpha )}} \cdot \frac{{\exp ( - \beta E_{D} - \alpha E_{W} )}}{\exp ( - M(w))} = \frac{{Z_{M} (\alpha ,\beta )}}{{Z_{D} (\beta )Z_{W} (\alpha )}} \\ \end{aligned} $$

Calculating \( Z_{M} (\alpha ,\beta ) \) through a Taylor series expansion, we can expand \( M(w) \) around the minimum point of the posterior density \( w_{\text{MAP}} \). So:

$$ Z_{M} \simeq (2\pi )^{W/2} (\det ((H_{\text{MAP}} )^{ - 1} )^{1/2} )\exp ( - M(w_{\text{MAP}} )) $$

\( H = \beta \nabla^{\text{2}} E_{D} + \alpha \nabla^{\text{2}} E_{W} \) is the Hessian matrix of the function \( M \).

With placement and taking the derivative, the optimum of \( \alpha \) and \( \beta \) will be obtained as below:

$$ \begin{aligned} \alpha_{\text{MAP}} & = \frac{\gamma }{{2E_{W} (w_{\text{MAP}} )}} \\ \beta_{\text{MAP}} & = \frac{N - \gamma }{{2E_{D} (w_{\text{MAP}} )}} \\ \end{aligned} $$

where \( \gamma = W - \alpha_{\text{MAP}} {\text{tr}}(H_{\text{MAP}} )^{ - 1} \).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baghbani, G., Eskandari, F. Calculating the required cash in bank branches: a Bayesian-data mining approach. Neural Comput & Applic 30, 2831–2841 (2018). https://doi.org/10.1007/s00521-017-2888-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-017-2888-9

Keywords

Navigation