Advertisement

Predicting Efficiency of Direct Marketing Campaigns for Financial Institutions

  • Sneh GajiwalaEmail author
  • Arjav Mehta
  • Mitchell D’silva
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 941)

Abstract

All marketing campaigns are dependent on the data that their clients provide. These datasets include everything from their name, number, their salary, the loans they’ve already taken, the money they have in their account etc. These datasets are huge and it is impossible for a human to analyze the patterns in the client deposits and whether the campaign will be a success or not. This paper introduces prediction of the success rates of the campaigns with the help of various machine learning predictive algorithms: Random forest, KNN and KNN using tensor flow framework. In the recent years, the success of general campaigns led by financial institutions have been declining and to step up their game and increase campaign effectiveness they need to target the clients very specifically. The predictive results obtained, with the highest accuracy, help in increasing the target audience and ensure that it will be a success for the financial institutions in picking out clients who will subscribe to the different marketing schemes. This paper uses multiple accuracy parameters to predict the potential success a direct marketing campaign will have on specific clients.

Keywords

Direct marketing KNN Random Forests TensorFlow Sensitivity Specificity 

References

  1. 1.
  2. 2.
    Investopedia, Direct Marketing. https://www.investopedia.com/terms/d/direct-marketing.asp. Accessed 04 Oct 2018
  3. 3.
    Elsalamony, H.A.: Bank direct marketing analysis of data mining techniques. Int. J. Comput. Appl. 85(7), (2014). ISSN 0975–8887. https://research.ijcaonline.org/volume85/number7/pxc3893218.pdf
  4. 4.
    Syarif, S., Anwar, Dewiani: Trending topic prediction by optimizing K-nearest neighbor algorithm. In: 2017 4th International Conference on Computer Applications and Information Processing Technology (CAIPT) (2017).  https://doi.org/10.1109/caipt.2017.8320711
  5. 5.
    Imandoust, S.B., Bolandraftar, M.: Application of k-nearest neighbor (KNN) approach for predicting economic events: theoretical background. Int. J. Eng. Res. Appl. 3(5), 605–610 (2013). https://www.ijera.com/papers/Vol3_issue5/DI35605610.pdfGoogle Scholar
  6. 6.
    Alkhatib, K., Najadat, H., Hmeidi, I., Shatnawi, M.K.A.: Stock price prediction using K-nearest neighbor (KNN) algorithm. Int. J. Bus. Humanit. Technol. 3(3), 32–44 (2013). https://www.ijbhtnet.com/journals/Vol_3_No_3_March_2013/4.pdfGoogle Scholar
  7. 7.
    Analytics Vidhya, K - Nearest Neighbour. https://www.analyticsvidhya.com/blog/2018/03/introduction-k-neighbours-algorithm-clustering/. Accessed 04 Oct 2018
  8. 8.
  9. 9.
    Medium, Random Forest Algorithm. https://medium.com/@williamkoehrsen/random-forest-simple-explanation-377895a60d2d. Accessed 05 Oct 2018
  10. 10.
    Towards Data Science, Random Forest Algorithm. https://towardsdatascience.com/the-random-forest-algorithm-d457d499ffcd. Accessed 05 Oct 2018
  11. 11.
    Tensorflow, TensorFlow Guide. https://www.tensorflow.org/guide/. Accessed 07 Oct 2018
  12. 12.
    TensorFlow, Keras. https://www.tensorflow.org/guide/keras. Accessed 07 Oct 2018

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Sneh Gajiwala
    • 1
    Email author
  • Arjav Mehta
    • 1
  • Mitchell D’silva
    • 1
  1. 1.Dwarkadas J Sanghvi College of EngineeringMumbaiIndia

Personalised recommendations