Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan...
TL;DR我们提出了一种简单的决策树学习算法的泛化方法,称为 Top-k,它考虑了 k 个最佳属性作为可能的分割点,相较于贪婪算法和最优决策树算法,在准确率和可扩展性方面都取得了显著的优势。
Abstract
We propose a simple generalization of standard and empirically successful
decision tree learning algorithms such as ID3, C4.5, and CART. These
algorithms, which have been central to machine learning for decades,