BriefGPT.xyz
Feb, 2018
极速决策树
Extremely Fast Decision Tree
HTML
PDF
Chaitanya Manapragada, Geoff Webb, Mahsa Salehi
TL;DR
本研究提出一种新型的增量决策树学习算法，Hoeffding Anytime Tree，与当前最先进的Hoeffding Tree相比，具有更高的统计效率。该算法具有极快的决策树生成速度，能够有效应对概念漂移，并在绝大多数UCI数据集上取得了显著的预测精度。
Abstract
We introduce a novel
incremental decision tree learning algorithm
,
hoeffding anytime tree
, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementa
→