计算机工程2011，Vol.37Issue(13)：187-189,192,4.DOI:10.3969/j.issn.1000-3428.2011.13.060
一种基于束状搜索的组合分类器修剪方法
Combination Classifier Pruning Method Based on Beam Search
摘要
Abstract
Based on existing ensemble pruning methods, this paper presents a beam search-based combination pruning method from the view of expanding the search. The method adopts beam search method, and saves the first k optimal combinations while adding or removing a search-based ensemble in each step. That not only remains the characteristics of efficiently pruning of the original combination pruning methods in greedy way,but also reduces the risk that fast convergence leads to local optimum easily, makes combination classification after pruned closer to the global optimum. Comparison results show that this method has a higher accuracy of classification, and it is smaller than the original ensemble pruning methods on most datasets.关键词
组合分类/组合修剪/束状搜索/Bagging方法Key words
combination classification/ combination pruning/ beam search/ Bagging method分类
信息技术与安全科学引用本文复制引用
王亚松,郭华平,范明..一种基于束状搜索的组合分类器修剪方法[J].计算机工程,2011,37(13):187-189,192,4.基金项目
国家自然科学基金资助项目(60773048) （60773048）
