内存受限的Mondrian森林的动态包围圈大小调整
Dynamic Ensemble Size Adjustment for Memory Constrained Mondrian Forest
摘要:
监督学习算法通常假设在训练和测试阶段有足够的存储器来存储数据模型。然而,当数据以无限数据流的形式出现时,或者当学习算法部署在内存量减少的设备上时,这种假设是不现实的。这种内存约束会影响模型行为和假设。在本文中,我们表明,在内存限制下,增加基于树的集成分类器的大小会恶化其性能。特别是,我们的实验表明存在一个最佳的合奏大小的内存有界的蒙德里安森林的数据流,我们设计了一个算法来引导森林的最佳数量,通过使用估计过拟合。我们在各种真实和模拟数据集上测试了该算法的不同变体,我们得出的结论是,对于稳定的数据集,我们的方法可以达到最佳大小的蒙德里安森林性能的95%,甚至可以超过具有概念漂移的数据集。我们所有的方法都是在OrpailleCC开源库中实现的,可以在嵌入式系统和连接对象上使用。
英文摘要:
Supervised learning algorithms generally assume the availability of enough memory to store data models during the training and test phases. However, this assumption is unrealistic when data comes in the form of infinite data streams, or when learning algorithms are deployed on devices with reduced amounts of memory. Such memory constraints impact the model behavior and assumptions. In this paper, we show that under memory constraints, increasing the size of a tree-based ensemble classifier can worsen its performance. In particular, we experimentally show the existence of an optimal ensemble size for a memory-bounded Mondrian forest on data streams and we design an algorithm to guide the forest toward that optimal number by using an estimation of overfitting. We tested different variations for this algorithm on a variety of real and simulated datasets, and we conclude that our method can achieve up to 95% of the performance of an optimally-sized Mondrian forest for stable datasets, and can even outperform it for datasets with concept drifts. All our methods are implemented in the OrpailleCC open-source library and are ready to be used on embedded systems and connected objects.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。