Abstract
In this article, we analyze the effectiveness of the telemarketing campaign developed by the Portuguese bank. The main goal of this analysis was to estimate, is there existing ant colony algorithms are capable of building classifiers that lead to increasing the effectiveness of the telemarketing campaign. An additional question was related to the problem of adjusting the whole campaign to the actual needs of clients. Presented data include 17 attributes, including information about the efficiency of carried out conversations related to the bank deposit offer. The analysis presented in this article was developed on the basis of algorithms used for the decision trees construction such as CART and C4.5. As a result, a prediction allowing to estimate the result of the telemarketing conversation with a client was made. Conducted experiments allowed for the comparison of different classifiers. The comparison was made on the basis of different measures of classification efficiency. It is especially important in the case of the real-world data, where cardinality of decision classes is uneven. Conducted experiments allowed for the comparison of different classifiers. Initial evaluation confirms, that such an approach could be efficiently used for the dynamic data sets, like streams.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Al-Shayea, Q.K.: Evaluating marketing campaigns of banking using neural networks. In: Proceedings of the World Congress on Engineering, vol. 2 (2013)
Boryczka, U., Kozak, J.: Ant colony decision trees – a new method for constructing decision trees based on ant colony optimization. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ICCCI 2010. LNCS (LNAI), vol. 6421, pp. 373–382. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16693-8_39
Boryczka, U., Kozak, J.: On-the-go adaptability in the new ant colony decision forest approach. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8398, pp. 157–166. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05458-2_17
Bouckaert, R.R., et al.: Weka manual for version 3-7-10 (2013)
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Chapman & Hall, New York (1984)
Elsalamony, H.A.: Bank direct marketing analysis of data mining techniques. Int. J. Comput. Appl. 85(7), 12–22 (2014)
Kareem, I.A., Duaimi, M.G.: Modified decision tree classification algorithm for large data sets
Karim, M., Rahman, R.M.: Decision tree and naive bayes algorithm for classification and generation of actionable knowledge for direct marketing. J. Softw. Eng. Appl. 6(04), 196 (2013)
Khan, N., Khan, F.Z.: Data mining for fuzzy decision systems in banking. Data Min. Knowl. Eng. 5(1), 30–35 (2013)
Kozak, J., Boryczka, U.: Goal-oriented requirements for ACDT algorithms. In: Hwang, D., Jung, J.J., Nguyen, N.-T. (eds.) ICCCI 2014. LNCS (LNAI), vol. 8733, pp. 593–602. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11289-3_60
Kozak, J., Boryczka, U.: Multiple boosting in the ant colony decision forest meta-classifier. Knowl.-Based Syst. 75, 141–151 (2015)
Kozak, J., Boryczka, U.: Collective data mining in the ant colony decision tree approach. Inf. Sci. 372, 126–147 (2016)
Kozak, J., Boryczka, U.: Dynamic version of the ACDT/ACDF algorithm for H-bond data set analysis. In: Bǎdicǎ, C., Nguyen, N.T., Brezovan, M. (eds.) ICCCI 2013. LNCS (LNAI), vol. 8083, pp. 701–710. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40495-5_70
Lim, T.S., Loh, W.Y., Shih, Y.S.: A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Mach. Learn. 40(3), 203–228 (2000)
Moro, S., Cortez, P., Rita, P.: A data-driven approach to predict the success of bank telemarketing. Decis. Support Syst. 62, 22–31 (2014)
Moro, S., Laureano, R., Cortez, P.: Using data mining for bank direct marketing: an application of the CRISP-DM methodology. In: Proceedings of European Simulation and Modelling Conference-ESM 2011, pp. 117–121. Eurosis (2011)
Pavlović, D., Reljić, M., Jaćimović, S.: Application of data mining in direct marketing in banking sector. Industrija 42(1), 189–201 (2014)
Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81–106 (1986)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)
Quinlan, J.R.: Improved use of continuous attributes in c4.5. J. Artif. Intell. Res. (JAIR) 4, 77–90 (1996)
Reddy, D.L.S., Babu, B.R., Govardhan, A.: Outlier analysis of categorical data using NAVF. Informatica Economica 17(1), 5 (2013)
Rokach, L., Maimon, O.: Data Mining With Decision Trees: Theory And Applications. World Scientific Publishing, Singapore (2008)
Schapire, R.E.: The strength of weak learnability. Mach. Learn. 5, 197–227 (1990)
Shashidhara, B.M., Jain, S., Rao, V.D., Patil, N., Raghavendra, G.: Evaluation of machine learning frameworks on bank marketing and higgs datasets. In: 2015 Second International Conference on Advances in Computing and Communication Engineering (ICACCE), pp. 551–555. IEEE (2015)
Acknowledgement
This paper is co-funded by the National Science Centre, Poland: 2017/01/X/ST6/01477.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Kozak, J., Juszczuk, P. (2018). Ant Colony Optimization Algorithms in the Problem of Predicting the Efficiency of the Bank Telemarketing Campaign. In: Nguyen, N., Pimenidis, E., Khan, Z., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2018. Lecture Notes in Computer Science(), vol 11056. Springer, Cham. https://doi.org/10.1007/978-3-319-98446-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-98446-9_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98445-2
Online ISBN: 978-3-319-98446-9
eBook Packages: Computer ScienceComputer Science (R0)