Increasing the effectiveness of associative classification in terms of class imbalance by using a novel pruning algorithm

被引:13
|
作者
Chen, Wen-Chin [1 ]
Hsu, Chiun-Chieh [1 ]
Chu, Yu-Chun [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan
关键词
Associative classification; Direct marketing; Rare events; Class imbalance; Scoring; Probabilistic classifiers; PREDICTIVE ACCURACY;
D O I
10.1016/j.eswa.2012.05.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Having received considerable interest in recent years, associative classification has focused on developing a class classifier, with lesser attention paid to the probability classifier used in direct marketing. While contributing to this integrated framework, this work attempts to increase the prediction accuracy of associative classification on class imbalance by adapting the scoring based on associations (SBA) algorithm. The SBA algorithm is modified by coupling it with the pruning strategy of association rules in the probabilistic classification based on associations (PCBA) algorithm, which is adjusted from the CBA for use in the structure of the probability classifier. PCBA is adjusted from CBA by increasing the confidence through under-sampling, setting different minimum supports (minsups) and minimum confidences (minconfs) for rules of different classes based on each distribution, and removing the pruning rules of the lowest error rate. Experimental results based on benchmark datasets and real-life application datasets indicate that the proposed method performs better than C5.0 and the original SBA do, and the number of rules required for scoring is significantly reduced. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:12841 / 12850
页数:10
相关论文
共 50 条
  • [1] A novel algorithm for associative classification
    Kundu, Gourab
    Munir, Sirajum
    Bari, Md. Faizul
    Islam, Md. Monirul
    Murase, Kazuyuki
    NEURAL INFORMATION PROCESSING, PART II, 2008, 4985 : 453 - +
  • [2] Looking at the class associative classification training algorithm
    Thabtah, Fadi
    Mahmood, Qazafi
    McCluskey, Lee
    PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, 2008, : 426 - 431
  • [3] A new class based associative classification algorithm
    Tang, Zhonghua
    Liao, Qin
    IMECS 2007: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2007, : 685 - +
  • [4] A novel algorithm for associative classification of image blocks
    Xu, XY
    Han, GQ
    Min, HQ
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 46 - 51
  • [5] A New Hybrid Associative Classification Algorithm Based On OR-tree And Pruning Skills
    Liao, Qin
    Wu, Jianhui
    Tang, Zhonghua
    2009 INTERNATIONAL FORUM ON INFORMATION TECHNOLOGY AND APPLICATIONS, VOL 2, PROCEEDINGS, 2009, : 129 - 132
  • [6] A New Pruning Method for Associative Classification using Simulated Annealing Technique
    Najeeb, Moath M.
    Alzoubi, Bilal R.
    Al-Zghoul, Musab B.
    Al-Qahtani, Abdullah S.
    INNOVATION VISION 2020: SUSTAINABLE GROWTH, ENTREPRENEURSHIP, AND ECONOMIC DEVELOPMENT, VOLS 1-4, 2012, : 2021 - 2029
  • [7] SVM Classification: Optimization with the SMOTE Algorithm for the Class Imbalance Problem
    Demidova, Liliya
    Klyueva, Irina
    2017 6TH MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO), 2017, : 472 - 475
  • [8] Associative Classification Using an Immune Optimization Algorithm
    Zhang Lei
    Meng Lingrui
    Hou Chunjie
    2012 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS (ICAL), 2012, : 179 - 184
  • [9] A Novel Heuristic Algorithm for Privacy Preserving of Associative Classification
    Harnsamut, Nattapon
    Natwichai, Juggapong
    PRICAI 2008: TRENDS IN ARTIFICIAL INTELLIGENCE, 2008, 5351 : 273 - 283
  • [10] Online Classification Algorithm for Concept Drift and Class Imbalance Data Stream
    Lu K.-Z.
    Chen C.-F.
    Cai H.
    Wu D.-M.
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2022, 50 (03): : 585 - 597