arrow
返回

A novel ensemble pruning algorithm based on randomized greedy selective strategy and ballot

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

摘要

En 中文
Although the Directed Hill Climbing Ensemble Pruning (DHCEP) algorithm has achieved favorable classification performance, it often yields suboptimal solutions to the ensemble pruning problem, due to its limited exploration within the whole solution space, which inspires us with the development of a novel Ensemble Pruning algorithm based on Randomized Greedy Selective Strategy and Ballot (RGSS&B-EP), where randomization technique is introduced into the procedure of greedy ensemble pruning, and the final pruned ensemble is generated by ballot, which are the two major contributions of this paper. Experimental results, including t-tests on the three benchmark classification tasks, verified the validity of the proposed RGSS&B-EP algorithm. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Machine learning
Ensemble learning
Pattern recognition
Classifier
Ensemble pruning
AI总结

AI总结

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

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

暂无机构信息
引用论文

引用论文

Bagging predictorsBagging预测器
err1996-08-01
err1.0W
PREAI
errBreiman, L
err分享
err收藏
Soft margins for AdaBoostAdaBoost的软边距
err2001-01-01
err1.0K
errOAAI
errRätsch, G; Onoda, T; Müller, KR
err分享
err收藏
An ensemble uncertainty aware measure for directed hill climbing ensemble pruning
err2010-05-19
err90
errOAAI
errPartalas, Ioannis; Tsoumakas, Grigorios; Vlahavas, Ioannis
err分享
err收藏
err
IF0
err
err0
errOAAI
err
err分享
err收藏
学者 查看更多内容