返回
A novel ensemble pruning algorithm based on randomized greedy selective strategy and ballot
DOI:10.1016/j.neucom.2013.06.026.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization
MACHINE LEARNING
IF2.9
Pentagonal-bipyramidal molybdenum- and tungsten-(II) derivatives: crystal and molecular structure of 1–3-η-allyldicarbonylchlorobis-(trimethyl phosphite)molybdenum(II)五边形-双锥体钼-和钨-(II) 衍生物: 1-3-η-烯丙基二羰基氯-(亚磷酸三甲酯) 钼 (II) 的晶体和分子结构
An ensemble uncertainty aware measure for directed hill climbing ensemble pruning
MACHINE LEARNING
IF2.9

