FORESTS OF PROBABILITY ESTIMATION TREES

作者
Henrik Boström
出处
期刊:International Journal of Pattern Recognition and Artificial Intelligence [World Scientific]
卷期号:26 (02): 1251001-1251001 被引量:7
标识
DOI:10.1142/s0218001412510019
摘要

Probability estimation trees (PETs) generalize classification trees in that they assign class probability distributions instead of class labels to examples that are to be classified. This property has been demonstrated to allow PETs to outperform classification trees with respect to ranking performance, as measured by the area under the ROC curve (AUC). It has further been shown that the use of probability correction improves the performance of PETs. This has lead to the use of probability correction also in forests of PETs. However, it was recently observed that probability correction may in fact deteriorate performance of forests of PETs. A more detailed study of the phenomenon is presented and the reasons behind this observation are analyzed. An empirical investigation is presented, comparing forests of classification trees to forests of both corrected and uncorrected PETS on 34 data sets from the UCI repository. The experiment shows that a small forest (10 trees) of probability corrected PETs gives a higher AUC than a similar-sized forest of classification trees, hence providing evidence in favor of using forests of probability corrected PETs. However, the picture changes when increasing the forest size, as the AUC is no longer improved by probability correction. For accuracy and squared error of predicted class probabilities (Brier score), probability correction even leads to a negative effect. An analysis of the mean squared error of the trees in the forests and their variance, shows that although probability correction results in trees that are more correct on average, the variance is reduced at the same time, leading to an overall loss of performance for larger forests. The main conclusions are that probability correction should only be employed in small forests of PETs, and that for larger forests, classification trees and PETs are equally good alternatives.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
10349发布了新的文献求助10
刚刚
温与暖完成签到,获得积分10
1秒前
2秒前
付榆峰发布了新的文献求助10
3秒前
3秒前
9秒前
ant发布了新的文献求助10
9秒前
付榆峰完成签到,获得积分10
11秒前
小川完成签到,获得积分10
15秒前
望春风完成签到,获得积分10
15秒前
领导范儿应助10349采纳,获得10
16秒前
刘可完成签到,获得积分10
16秒前
16秒前
17秒前
ant完成签到,获得积分20
17秒前
领导范儿应助inp采纳,获得10
18秒前
混吃等死研究生完成签到,获得积分10
18秒前
18秒前
爱听歌的依霜完成签到,获得积分10
20秒前
追寻梦之完成签到 ,获得积分10
21秒前
科研通AI6.3应助我是谁采纳,获得10
21秒前
22秒前
郑伟李发布了新的文献求助10
22秒前
23秒前
24秒前
24秒前
苗条的桐发布了新的文献求助10
24秒前
钟鸿盛Domi发布了新的文献求助10
25秒前
大约在冬季完成签到,获得积分10
26秒前
嘻嘻嘻完成签到,获得积分10
27秒前
27秒前
正直未来发布了新的文献求助10
27秒前
夜月残阳发布了新的文献求助10
28秒前
橙留香完成签到,获得积分10
29秒前
29秒前
今后应助12采纳,获得10
30秒前
深情安青应助Yinzixin采纳,获得10
30秒前
qinxinxin发布了新的文献求助10
30秒前
明明完成签到,获得积分10
31秒前
Alec完成签到,获得积分10
35秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Data book on fatigue strength of metallic materials 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7567380
求助须知:如何正确求助?哪些是违规求助? 9147338
关于积分的说明 19560811
捐赠科研通 7153493
什么是DOI,文献DOI怎么找? 3262864
关于科研通互助平台的介绍 2428972
邀请新用户注册赠送积分活动 2252875