Integrating boosting and stochastic attribute selection committees for further improving the performance of decision tree learning

Zijian Zheng, Geoffrey I. Webb, K. Ting
{"title":"Integrating boosting and stochastic attribute selection committees for further improving the performance of decision tree learning","authors":"Zijian Zheng, Geoffrey I. Webb, K. Ting","doi":"10.1109/TAI.1998.744846","DOIUrl":null,"url":null,"abstract":"Techniques for constructing classifier committees including boosting and bagging have demonstrated great success, especially boosting for decision tree learning. This type of technique generates several classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Boosting and bagging create different classifiers by modifying the distribution of the training set. SASC (Stochastic Attribute Selection Committees) uses an alternative approach to generating classifier committees by stochastic manipulation of the set of attributes considered at each node during tree induction, but keeping the distribution of the training set unchanged. We propose a method for improving the performance of boosting. This technique combines boosting and SASC. It builds classifier committees by manipulating both the distribution of the training set and the set of attributes available during induction. In the synergy SASC effectively increases the model diversity of boosting. Experiments with a representative collection of natural domains show that, on average, the combined technique outperforms either boosting or SASC alone in terms of reducing the error rate of decision tree learning.","PeriodicalId":424568,"journal":{"name":"Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1998.744846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Techniques for constructing classifier committees including boosting and bagging have demonstrated great success, especially boosting for decision tree learning. This type of technique generates several classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Boosting and bagging create different classifiers by modifying the distribution of the training set. SASC (Stochastic Attribute Selection Committees) uses an alternative approach to generating classifier committees by stochastic manipulation of the set of attributes considered at each node during tree induction, but keeping the distribution of the training set unchanged. We propose a method for improving the performance of boosting. This technique combines boosting and SASC. It builds classifier committees by manipulating both the distribution of the training set and the set of attributes available during induction. In the synergy SASC effectively increases the model diversity of boosting. Experiments with a representative collection of natural domains show that, on average, the combined technique outperforms either boosting or SASC alone in terms of reducing the error rate of decision tree learning.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合boosting和随机属性选择委员会,进一步提高决策树学习的性能
构建分类器委员会的技术包括boosting和bagging已经取得了巨大的成功,特别是对决策树学习的boosting。这种技术通过重复应用单一基学习算法,生成多个分类器组成一个委员会。委员会成员投票决定最终的分类。Boosting和bagging通过修改训练集的分布来创建不同的分类器。SASC(随机属性选择委员会)使用另一种方法来生成分类器委员会,即在树归纳过程中对每个节点考虑的属性集进行随机操作,但保持训练集的分布不变。我们提出了一种提高助推性能的方法。这种技术结合了增强和SASC。它通过操纵训练集的分布和归纳期间可用的属性集来构建分类器委员会。在协同增效中,SASC有效地增加了助推模式的多样性。具有代表性的自然域集合的实验表明,在降低决策树学习的错误率方面,平均而言,组合技术优于增强或单独的SASC。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A hybrid case-based medical diagnosis system A weight analysis-based wrapper approach to neural nets feature subset selection Fragmentation problem and automated feature construction Combining cellular genetic algorithms and local search for solving satisfiability problems An artificial intelligence based tool for home automation using MATLAB
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1