arrow
返回

Dynamic Random Forests

delete2012-09-01
delete94
delete
OA
AI
S
Simon Bernard
S
Sébastien Adam
L
Laurent Heutte *
DOI:10.1016/j.patrec.2012.04.003delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In this paper, we introduce a new Random Forest (RF) induction algorithm called Dynamic Random Forest (DRF) which is based on an adaptative tree induction procedure. The main idea is to guide the tree induction so that each tree will complement as much as possible the existing trees in the ensemble. This is done here through a resampling of the training data, inspired by boosting algorithms, and combined with other randomization processes used in traditional RF methods. The DRF algorithm shows a significant improvement in terms of accuracy compared to the standard static RF induction algorithm. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Random forests
Ensemble of classifiers
Random feature selection
Dynamic induction
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
8.0K
被引数:
2.0W

机构

U
universite de rouen normandie
学者数:
121
论文数: 52
被引数: 3.3K
引用论文

引用论文

Workplace Aerosol Measurement
err2011-07-07
err0
PREAI
errJon C. Volkwein; Andrew D. Maynard; Martin Harper
err分享
err收藏
Bagging predictorsBagging预测器
err1996-08-01
err1.0W
PREAI
errBreiman, L
err分享
err收藏
The protein and volatile components of trail mucus in the Common Garden Snail, Cornu aspersum
err2021-05-27
err0
errOAAI
errKaylene R. Ballard; Anne H. Klein; Richard A. Hayes; Tianfang Wang; Scott F. Cummins
err分享
err收藏
学者 查看更多内容