An Empirical Comparison of Two Boosting Algorithms on Real Data Sets Based on Analysis of Scientific Materials

被引:0
|
作者
Sun, Xiaowei [1 ]
Zhou, Hongbo [2 ]
机构
[1] Shenyang Normal Univ, Software Coll, Shenyang 110034, Peoples R China
[2] Liaoning SG Automotive Group CO LTD, Shenyang 110027, Peoples R China
关键词
boosting; combination method; TAN; BAN; Bayesian network classifier;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Boosting algorithms are a means of building a strong ensemble classifier by aggregating a sequence of weak hypotheses. In this paper, multiple TAN classifiers generated by GTAN are combined by a combination method called Boosting-MultiTAN. This TAN combination classifier is compared with the Boosting-BAN classifier which is boosting based on BAN combination. We conduct an empirical study to compare the performance of two algorithms, measured in terms of overall test correct rate, on ten real data sets. Finally, experimental results show that the Boosting-BAN has higher classification accuracy on most data sets, but Boosting-MultiTAN has good effect on others. These results argue that boosting algorithms deserve more attention in machine learning and data mining communities.
引用
收藏
页码:327 / +
页数:2
相关论文
共 50 条
  • [1] An empirical comparison of two boosting algorithms on real data sets based on analysis of scientific materials
    Sun X.
    Zhou H.
    Advances in Intelligent and Soft Computing, 2011, 105 : 327 - 331
  • [2] An Empirical Comparison of Two Boosting Algorithms on Real Data Sets with Artificial Class Noise
    Sun, Xiaowei
    Zhou, Hongbo
    ADVANCES IN INFORMATION TECHNOLOGY AND EDUCATION, PT I, 2011, 201 : 23 - +
  • [3] An empirical comparison of three boosting algorithms on real data sets with artificial class noise
    McDonald, RA
    Hand, DJ
    Eckley, IA
    MULTIPLE CLASSIFIER SYSTEMS, PROCEEDING, 2003, 2709 : 35 - 44
  • [4] Empirical comparison of boosting algorithms
    Khanchel, R
    Limam, M
    Classification - the Ubiquitous Challenge, 2005, : 161 - 167
  • [5] Empirical comparison of fast partitioning-based clustering algorithms for large data sets
    Wei, CP
    Lee, YH
    Hsu, CM
    EXPERT SYSTEMS WITH APPLICATIONS, 2003, 24 (04) : 351 - 363
  • [6] Comparison of Pagination Algorithms Based-on Large Data Sets
    Cao, Junkuo
    Wang, Weihua
    Shu, Yuanzhong
    INFORMATION AND AUTOMATION, 2011, 86 : 384 - 389
  • [7] An empirical comparison of voting classification algorithms: Bagging, boosting, and variants
    Bauer, E
    Kohavi, R
    MACHINE LEARNING, 1999, 36 (1-2) : 105 - 139
  • [8] An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
    Eric Bauer
    Ron Kohavi
    Machine Learning, 1999, 36 : 105 - 139
  • [9] Efficient algorithms for mining long patterns in scientific data sets
    Agarwal, RC
    Aggarwal, CC
    DATA MINING FOR SCIENTIFIC AND ENGINEERING APPLICATIONS, 2001, 2 : 541 - 566
  • [10] Empirical Analysis of Data Clustering Algorithms
    Nerurkar, Pranav
    Shirke, Archana
    Chandane, Madhav
    Bhirud, Sunil
    6TH INTERNATIONAL CONFERENCE ON SMART COMPUTING AND COMMUNICATIONS, 2018, 125 : 770 - 779