arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.05925stat.MLcs.LG
收藏

随机森林

Feature-Budgeted Random Forest

Boston University(波士顿大学)

Feng Nan, Joseph Wang, Venkatesh Saligrama

摘要:

我们寻求降低预测时间成本的决策规则,其中完整的数据可用于训练,但在预测时间,每个特征只能以额外的成本获得。我们提出了一种新的随机森林算法,以最大限度地减少预测误差为用户指定的{ \it average}特征采集预算。虽然随机森林具有很强的泛化性能,但它们没有明确考虑特征成本,而且需要树之间的低相关性,这放大了成本。我们的随机森林生长的树木具有低收购成本和高强度的贪婪极大极小成本加权杂质分裂的基础上。从理论上讲,我们建立了接近最优的收购成本保证我们的算法。从经验上讲,在一些基准数据集上,我们展示了优于最先进的预测时间算法的准确性-成本曲线。

英文摘要:

We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to minimize prediction error for a user-specified {\it average} feature acquisition budget. While random forests yield strong generalization performance, they do not explicitly account for feature costs and furthermore require low correlation among trees, which amplifies costs. Our random forest grows trees with low acquisition cost and high strength based on greedy minimax cost-weighted-impurity splits. Theoretically, we establish near-optimal acquisition cost guarantees for our algorithm. Empirically, on a number of benchmark datasets we demonstrate superior accuracy-cost curves against state-of-the-art prediction-time algorithms.

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

↑