.png){kind=icon}
返回
Evidential Random Forests
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2023.120652.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In machine learning, some models can make uncertain and imprecise predictions, they are called evidential models. These models may also be able to handle imperfect labeling and take into account labels that are richer than the commonly used hard labels, containing uncertainty and imprecision. This paper proposes an Evidential Decision Tree, and an Evidential Random Forest. These two models use a distance and a degree of inclusion to allow the model to group observations whose response elements are included in each other into a single node. Experimental results showed better performance for the presented methods compared to other evidential models and to recent Cautious Random Forests when the data is noisy. The models also offer a better robustness to the overfitting effect when using datasets that are effectively uncertainly and imprecisely labeled by the contributors. The proposed models are also able to predict rich labels, an information that can be used in other approaches, such as active learning.
Keyword:
Decision tree
Random forest
Classification
Rich labels
Dempster-Shafer theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
Stability of Iodine in Iodized Salt Used for Correction of Iodine-Deficiency Disorders. II用于纠正碘缺乏病的碘盐中碘的稳定性。二
.png){kind=icon}
PREAI
分享收藏Coaches’ implicit associations between size and giftedness: implications for the relative age effect
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容