Reinforced Random Forest

被引:5
|
作者
Paul, Angshuman [1 ]
Mukherjee, Dipti Prasad [1 ]
机构
[1] Indian Stat Inst, 203 BT Rd, Kolkata, India
关键词
Random forest; reinforcement learning; classification accuracy; shortest path; MITOSIS;
D O I
10.1145/3009977.3010003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reinforcement learning improves classification accuracy. But use of reinforcement learning is relatively unexplored in case of random forest classifier. We propose a reinforced random forest (RRF) classifier that exploits reinforcement learning to improve classification accuracy. Our algorithm is initialized with a forest. Then the entire training data is tested using the initial forest. In order to reinforce learning, we use mis-classified data points to grow certain number of new trees. A subset of the new trees is added to the existing forest using a novel graph-based approach. We show that addition of these trees ensures improvement in classification accuracy. This process is continued iteratively until classification accuracy saturates. The proposed RRF has low computational burden. We achieve at least 3% improvement in F-measure compared to random forest in three breast cancer datasets. Results on benchmark datasets show significant reduction in average classification error.
引用
收藏
页数:8
相关论文
共 50 条