QQ客服 官方微博 反馈留言

	BOAI: Fast alternating decision tree induction based on bottom-up evaluation
	Yang, Bishan ; Wang, Tengjiao ; Yang, Dongqing ; Chang, Lei
	2008
关键词	classification decision tree ADTree BOAI
英文摘要	Alternating Decision Tree (ADTree) is a successful classification model based on boosting and has a wide range of applications. The existing ADTree induction algorithms apply a "top-down" strategy to evaluate the best split at each boosting iteration, which is very time-consuming and thus is unsuitable for modeling on large data sets. This paper proposes a fast ADTree induction algorithm (BOAI) based on "bottom-up" evaluation, which offers high performance on massive data without sacrificing classification accuracy. BOAI uses a pre-sorting technique and dynamically evaluates splits by a bottom-up approach based on VW-group. With these techniques, huge redundancy in sorting and computation can be eliminated in the tree induction procedure. Experimental results on both real and synthetic data sets show that BOAI outperforms the best existing ADTree induction algorithm by a significant margin. In the real case study, BOAI also provides better performance than TreeNet and Random Forests, which are considered as efficient classification models.; Computer Science, Artificial Intelligence; CPCI-S(ISTP); 3
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/406634]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Yang, Bishan,Wang, Tengjiao,Yang, Dongqing,et al. BOAI: Fast alternating decision tree induction based on bottom-up evaluation. 2008-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。