首页> 外文会议>2014 IEEE Symposium on Computational Intelligence in Ensemble Learning >Experiments on simultaneous combination rule training and ensemble pruning algorithm
【24h】

Experiments on simultaneous combination rule training and ensemble pruning algorithm

机译:同时组合规则训练和整体修剪算法的实验

获取原文
获取原文并翻译 | 示例

摘要

Nowadays many researches related to classifier design are trying to exploit strength of the ensemble learning. Such hybrid approach looks for the valuable combination of individual classifiers' outputs, which should at least outperforms quality of the each available individuals. Therefore the classifier ensembles are recently the focus of intense research. Basically, it faces with two main problems. On the one hand we look for the valuable, highly diverse pool of individual classifiers, i.e., they are expected to be mutually complimentary. On the other hand we try to propose an optimal combination of the individuals' outputs. Usually, mentioned above tasks are considering independently, i.e., there are several approaches which focus on the ensemble pruning only for a given combination rule, while the others works are devoted to the problem how to find an optimal combination rule for a fixed line-up of classifier pool. In this work we propose to put ensemble pruning and combination rule training together and consider them as the one optimization task. We employ a canonical genetic algorithm to find the best ensemble line-up and in the same time the best set-up of the combination rule parameters. The proposed concept (called CRUMP - simultaneous Combination RUle training and enseMble Pruning) was evaluated on the basis the wide range of computer experiments, which confirmed that this is the very promising direction which is able to outperform the traditional approaches focused on either the ensemble pruning or combination rule.
机译:如今,与分类器设计相关的许多研究都在尝试利用集成学习的优势。这种混合方法寻找单个分类器的输出的有价值的组合,这至少应超过每个可用个体的质量。因此,分类器集成是近期研究的重点。基本上,它面临两个主要问题。一方面,我们寻找有价值的,高度多样化的单个分类器库,即它们有望相互补充。另一方面,我们尝试提出个人产出的最佳组合。通常,上述任务是独立考虑的,即,有几种方法仅针对给定组合规则着重整体修剪,而其他方法则致力于解决如何为固定阵容找到最佳组合规则的问题。分类池。在这项工作中,我们建议将整体修剪和组合规则训练放在一起,并将它们视为一项优化任务。我们采用规范的遗传算法来找到最佳的合奏阵容,同时找到最佳组合规则参数。在广泛的计算机实验的基础上,对所提出的概念(称为CRUMP-同步组合规则训练和整体修剪)进行了评估,这证实了这是一个非常有前途的方向,它能够超越侧重于整体修剪的传统方法或组合规则。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号