通用分布式框架下基于目标最大化的包围体剪枝
Ensemble Pruning based on Objection Maximization with a General Distributed Framework
摘要:
集成剪枝从原始集成中选择一个个体学习器子集,弥补了集成学习在时间和空间代价上的不足。准确性和多样性是两个至关重要的因素,但它们往往相互冲突。为了平衡这两者,我们形式化的集成修剪问题的目标最大化问题的基础上的信息熵。然后,我们提出了一个集成修剪方法,包括一个集中式版本和一个分布式版本,其中后者是加快前者。最后,我们提取了一个通用的分布式集成剪枝框架,它可以广泛适用于大多数现有的集成剪枝方法,并实现了更少的时间消耗没有太多的精度下降。实验结果验证了我们的框架和方法的效率,特别是关于一个显着的提高执行速度,伴随着令人满意的准确性性能。
英文摘要:
Ensemble pruning, selecting a subset of individual learners from an original ensemble, alleviates the deficiencies of ensemble learning on the cost of time and space. Accuracy and diversity serve as two crucial factors while they usually conflict with each other. To balance both of them, we formalize the ensemble pruning problem as an objection maximization problem based on information entropy. Then we propose an ensemble pruning method including a centralized version and a distributed version, in which the latter is to speed up the former. At last, we extract a general distributed framework for ensemble pruning, which can be widely suitable for most of the existing ensemble pruning methods and achieve less time consuming without much accuracy degradation. Experimental results validate the efficiency of our framework and methods, particularly concerning a remarkable improvement of the execution speed, accompanied by gratifying accuracy performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。