• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Knowledge-Based Systems >An efficient ensemble pruning algorithm using One-Path and Two-Trips searching approach
【24h】

An efficient ensemble pruning algorithm using One-Path and Two-Trips searching approach

机译：一种有效的整体修剪算法，使用一路径和两三段式搜索方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Ensemble pruning is substantial for the successful application of an ensemble system. A novel method for Ensemble Pruning via BackTracking algorithm (EnPBT) was proposed by us in our previous work. Backtracking algorithm can systematically search for the solutions of a problem in a depth-first and jumping manner, suitable for solving all those large-scale combinatorial problems. The validity of EnPBT algorithm has been verified in our previous work. However, the relatively slow pruning speed might be a drawback of EnPBT. Aiming at this problem, an efficient and novel ensemble pruning algorithm is proposed in this paper, i.e. One-Path and Two-Trips (OPTT) ensemble pruning algorithm. It is very fast in pruning speed, while its classification performance has no significant difference with EnPBT, as demonstrated in the experimental results of this work. In short, OPTT achieves a proper trade-off between pruning effectiveness and efficiency.
机译：集成修剪对于成功应用集成系统至关重要。在之前的工作中，我们提出了一种通过BackTracking算法（EnPBT）进行合奏修剪的新方法。回溯算法可以深度优先和跳跃的方式系统地搜索问题的解决方案，适用于解决所有这些大规模组合问题。 EnPBT算法的有效性已在我们之前的工作中得到验证。但是，相对较慢的修剪速度可能是EnPBT的缺点。针对这一问题，本文提出了一种高效新颖的整体修剪算法，即一路径和两段式（OPTT）整体修剪算法。如这项工作的实验结果所示，它的修剪速度非常快，而其分类性能与EnPBT并无显着差异。简而言之，OPTT在修剪效率和效率之间实现了适当的权衡。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号