首页> 美国卫生研究院文献>Computational Intelligence and Neuroscience >Margin-Based Pareto Ensemble Pruning: An Ensemble Pruning Algorithm That Learns to Search Optimized Ensembles
【2h】

Margin-Based Pareto Ensemble Pruning: An Ensemble Pruning Algorithm That Learns to Search Optimized Ensembles

机译:基于边距的帕累托组合修剪:一种学习搜索优化组合的组合修剪算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The ensemble pruning system is an effective machine learning framework that combines several learners as experts to classify a test set. Generally, ensemble pruning systems aim to define a region of competence based on the validation set to select the most competent ensembles from the ensemble pool with respect to the test set. However, the size of the ensemble pool is usually fixed, and the performance of an ensemble pool heavily depends on the definition of the region of competence. In this paper, a dynamic pruning framework called margin-based Pareto ensemble pruning is proposed for ensemble pruning systems. The framework explores the optimized ensemble pool size during the overproduction stage and finetunes the experts during the pruning stage. The Pareto optimization algorithm is used to explore the size of the overproduction ensemble pool that can result in better performance. Considering the information entropy of the learners in the indecision region, the marginal criterion for each learner in the ensemble pool is calculated using margin criterion pruning, which prunes the experts with respect to the test set. The effectiveness of the proposed method for classification tasks is assessed using datasets. The results show that margin-based Pareto ensemble pruning can achieve smaller ensemble sizes and better classification performance in most datasets when compared with state-of-the-art models.
机译:整体修剪系统是一种有效的机器学习框架,该框架将多个学习者作为专家进行组合以对测试集进行分类。通常,合奏修剪系统旨在基于验证集定义权限区域,以从合奏池中选择相对于测试集最有能力的合奏。但是,合奏池的大小通常是固定的,并且合奏池的性能在很大程度上取决于权限区域的定义。在本文中,针对集合修剪系统提出了一种动态修剪框架,称为基于边距的帕累托集合修剪。该框架在超量生产阶段探索优化的集合池大小,并在修剪阶段微调专家。 Pareto优化算法用于探究可以提高性能的生产过剩集合池的大小。考虑到不确定区域中学习者的信息熵,使用边际标准修剪来计算集合池中每个学习者的边际标准,这会修剪测试集方面的专家。使用数据集评估了用于分类任务的方法的有效性。结果表明,与最新模型相比,基于边际的Pareto集合修剪可以在大多数数据集中实现更小的集合大小和更好的分类性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号