Ant Colony Optimization Algorithms in the Problem of Predicting the Efficiency of the Bank Telemarketing Campaign

被引:0
|
作者
Kozak, Jan [1 ]
Juszczuk, Przemyslaw [1 ]
机构
[1] Univ Econ, Fac Informat & Commun, Dept Knowledge Engn, 1 Maja 50, PL-40287 Katowice, Poland
关键词
Bank telemarketing campaign; Ant colony optimization; Ant colony decision trees; Decision tree;
D O I
10.1007/978-3-319-98446-9_31
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:335 / 344
页数:10
相关论文
共 50 条
  • [1] Predicting Customer Response to Bank Direct Telemarketing Campaign
    Asare-Frempong, Justice
    Jayabalan, Manoj
    2017 INTERNATIONAL CONFERENCE ON ENGINEERING TECHNOLOGY AND TECHNOPRENEURSHIP (ICE2T), 2017,
  • [2] Predicting Customer's Subscription Response to Bank Telemarketing Campaign Based on Machine learning Algorithms
    Saeed, Saad Ebrahim
    Hammad, Mustafa
    Alqaddoumi, Abdulla
    2022 INTERNATIONAL CONFERENCE ON DECISION AID SCIENCES AND APPLICATIONS (DASA), 2022, : 1474 - 1478
  • [3] Ant Colony Optimization Algorithms with Diversified Search in the Problem of Optimization of Airtravel Itinerary
    L. Hulianytskyi
    A. Pavlenko
    Cybernetics and Systems Analysis, 2019, 55 : 978 - 987
  • [4] ANT COLONY OPTIMIZATION ALGORITHMS WITH DIVERSIFIED SEARCH IN THE PROBLEM OF OPTIMIZATION OF AIRTRAVEL ITINERARY
    Hulianytskyi, L.
    Pavlenko, A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2019, 55 (06) : 978 - 987
  • [5] Ant Colony Optimization Algorithms for Wireless Network Planning Problem Solving
    Skakov, Evgenii
    Malysh, Vladimir
    2015 INTERNATIONAL CONFERENCE "STABILITY AND CONTROL PROCESSES" IN MEMORY OF V.I. ZUBOV (SCP), 2015, : 348 - 352
  • [6] Riverview on ant colony optimization algorithms
    Li, Yancang
    Ban, Chenguang
    Li, Rouya
    WORLD JOURNAL OF ENGINEERING, 2013, 10 (05) : 491 - 496
  • [7] The fault diagnosis inverse problem with Ant Colony Optimization and Ant Colony Optimization with dispersion
    Camps Echevarria, Lidice
    de Campos Velho, Haroldo Fraga
    Becceneri, Jose Carlos
    da Silva Neto, Antonio Jose
    Llanes Santiago, Orestes
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 227 : 687 - 700
  • [8] Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem
    Musa, Rami
    Chen, F. Frank
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (7-8): : 837 - 850
  • [9] Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem
    Rami Musa
    F. Frank Chen
    The International Journal of Advanced Manufacturing Technology, 2008, 37 : 837 - 850
  • [10] Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem
    Mavrovouniotis, Michalis
    Anastasiadou, Maria N.
    Hadjimitsis, Diofantos
    ALGORITHMS, 2023, 16 (12)