arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.2363cs.LGcs.AIstat.ML
收藏

多决策树

Multiple decision trees

University of Sydney(悉尼大学)

Suk Wah Kwok, Chris Carter

摘要:

本文介绍了实验,在两个领域,调查的影响,平均多个决策树的预测,而不是使用一个单一的树。其他作者指出了倾向于多树方法的理论和常识原因。理想情况下,我们会考虑所有树的预测,并根据它们的概率进行加权。然而,存在大量不同的树,很难估计每棵树的概率。我们避开了估计问题,使用修改版本的ID 3算法来构建良好的树,并平均只在这些树。我们的成果令人鼓舞。对于每个域,我们设法产生少量的好树。我们发现,最好是在具有不同结构的树的集合之间取平均值;这通常比任何组成树(包括ID 3树)提供更好的性能。

英文摘要:

This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring the multiple tree approach. Ideally, we would like to consider predictions from all trees, weighted by their probability. However, there is a vast number of different trees, and it is difficult to estimate the probability of each tree. We sidestep the estimation problem by using a modified version of the ID3 algorithm to build good trees, and average over only these trees. Our results are encouraging. For each domain, we managed to produce a small number of good trees. We find that it is best to average across sets of trees with different structure; this usually gives better performance than any of the constituent trees, including the ID3 tree.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑