arrow
返回

A competitive ensemble pruning approach based on cross-validation technique

delete2013-01-01
delete71
PRE
AI
戴
戴群 (Qun Dai) *
DOI:10.1016/j.knosys.2012.08.024delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Ensemble pruning is crucial for the consideration of both efficiency and predictive accuracy of an ensemble system. This paper proposes a new Competitive technique for Ensemble Pruning based on Cross-Validation (CEPCV). The data to be learnt by neural computing models are mostly drifting with time and environment, therefore a dynamic ensemble pruning method is indispensable for practical applications, while the proposed CEPCV method is just the kind of dynamic ensemble pruning method, which can realize on-line ensemble pruning and take full advantage of potentially valuable information. The algorithm naturally inherits the predominance of cross-validation technique, which implies that those networks regarded as winners in selective competitions and chosen into the pruned ensemble have the strongest generalization capability. It is essentially based on the strategy of divide and rule, collect the wisdom, and might alleviate the local minima problem of many conventional ensemble pruning approaches only at the cost of a little greater computational cost, which is acceptable to most applications of ensemble learning. The comparative experiments among the four ensemble pruning algorithms, including: CEPCV and the state-of-the-art Directed Hill Climbing Ensemble Pruning (DHCEP) algorithm and two baseline methods, i.e. BSM, which chooses the Best Single Model in the initial ensemble based on their performances on the pruning set, and ALL, which reserves all network members of the initial ensemble, on ten benchmark classification tasks, demonstrate the effectiveness and validity of CEPCV. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Neural networks ensemble
Ensemble pruning
Concept-drifting data
Cross-validation
Competitive learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

暂无机构信息
引用论文

引用论文

Controlled Anisotropic Growth of Co‐Fe‐P from Co‐Fe‐O NanoparticlesCo-fe-o纳米颗粒控制co-fe-p的各向异性生长
err2015-06-26
err0
errOAAI
errAdriana Mendoza‐Garcia; Huiyuan Zhu; Yongsheng Yu; Qing Li; Lin Zhou; Dong Su; Matthew J. Kramer; Shouheng Sun
err分享
err收藏
EROS: Ensemble rough subspaces
err2007-12-01
err89
PREAI
errHu, Qinghua; Yu, Daren; Xie, Zongxia; Li, Xiaodong
err分享
err收藏
err
IF0
err
err0
errOAAI
err
err分享
err收藏
Pruning an ensemble of classifiers via reinforcement learning
err2009-03-01
err77
PREAI
errPartalas, Ioannis; Tsoumakas, Grigorios; Vlahavas, Ioannis
err分享
err收藏
err分享
err收藏
Evaluation of post-stroke functionality based on the International Classification of Functioning, Disability, and Health: a proposal for use of assessment tools
err2015-01-01
err0
errOAAI
errSoraia Micaela Silva; Fernanda Ishida Corrêa; Christina Danielli Coelho de Morais Faria; Cássia Maria Buchalla; Paula Fernanda da Costa Silva; João Carlos Ferrari Corrêa
err分享
err收藏
学者 查看更多内容