Forest CERN: A New Decision Forest Building Technique

被引:20
作者
Adnan, Md. Nasim [1 ]
Islam, Md. Zahidul [1 ]
机构
[1] Charles Sturt Univ, Sch Comp & Math, Bathurst, NSW 2795, Australia
来源
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2016, PT I | 2016年 / 9651卷
关键词
Decision tree; Decision forest; Ensemble accuracy;
D O I
10.1007/978-3-319-31753-3_25
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Persistent efforts are going on to propose more accurate decision forest building techniques. In this paper, we propose a new decision forest building technique called "Forest by Continuously Excluding Root Node (Forest CERN)". The key feature of the proposed technique is that it strives to exclude attributes that participated in the root nodes of previous trees by imposing penalties on them to obstruct them appear in some subsequent trees. Penalties are gradually lifted in such a manner that those attributes can reappear after a while. Other than that, our technique uses bootstrap samples to generate predefined number of trees. The target of the proposed algorithm is to maximize tree diversity without impeding individual tree accuracy. We present an elaborate experimental results involving fifteen widely used data sets from the UCI Machine Learning Repository. The experimental results indicate the effectiveness of the proposed technique in most of the cases.
引用
收藏
页码:304 / 315
页数:12
相关论文
共 22 条
[1]  
Adnan MN, 2014, LECT NOTES ARTIF INT, V8933, P370, DOI 10.1007/978-3-319-14717-8_29
[2]  
Amasyali M. F., 2014, IEEE T KNOWL DATA EN, V16, P145
[3]  
[Anonymous], 2012, Cluster Analysis: Basic Concepts and Methods, DOI DOI 10.1016/B978-0-12-381479-1.00010-1
[4]  
Arlot S., STAT SURV
[5]  
Bache K, 2013, UCI machine learning repository
[6]  
Bernard S, 2008, LECT NOTES COMPUT SC, V5227, P430, DOI 10.1007/978-3-540-85984-0_52
[7]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[8]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[9]  
Breiman L, 1985, CLASSIFICATION REGRE
[10]  
Demsar J, 2006, J MACH LEARN RES, V7, P1