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

用少量资源训练大型随机森林

Training Big Random Forests with Little Resources

Department of Computer Science University of Copenhagen(哥本哈根大学计算机科学系)

Fabian Gieseke, Christian Igel

摘要:

在无法访问大型计算集群的情况下,在大型数据集上构建随机森林仍然是一个具有挑战性的问题。特别是,如果需要完全生长的树木,情况就是如此。我们提出了一个简单而有效的框架,允许有效地构建合奏的巨大的树木数亿甚至数十亿的训练实例使用廉价的台式计算机与商品硬件。其基本思想是考虑一个多级构造方案,该方案为可用数据的小随机子集构建顶树,然后将所有训练实例分发到顶树的叶子上进行进一步处理。虽然在概念上很简单,但总体效率关键取决于不同阶段的具体实施。使用具有数亿训练实例的密集数据集证明了我们方法的实际优点。

英文摘要:

Without access to large compute clusters, building random forests on large datasets is still a challenging problem. This is, in particular, the case if fully-grown trees are desired. We propose a simple yet effective framework that allows to efficiently construct ensembles of huge trees for hundreds of millions or even billions of training instances using a cheap desktop computer with commodity hardware. The basic idea is to consider a multi-level construction scheme, which builds top trees for small random subsets of the available data and which subsequently distributes all training instances to the top trees' leaves for further processing. While being conceptually simple, the overall efficiency crucially depends on the particular implementation of the different phases. The practical merits of our approach are demonstrated using dense datasets with hundreds of millions of training instances.

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

↑