| 改进的分支定界算法 |
| |
| 引用本文： | 孙树亮,陈忠,刘政连. 改进的分支定界算法[J]. 软件, 2011, 0(10): 32-34 |
| |
| 作者姓名： | 孙树亮 陈忠 刘政连 |
| |
| 作者单位： | 福建师范大学福清分校数计系;伦敦大学皇家哈洛威学院资讯安全研究中心; |
| |
| 基金项目： | 青年教师启动基金KY2011003 |
| |
| 摘 要： | 如何进行最优的特征选择是模式识别的研究重点之一。目前比较常用的最优特征选择方法是BAB和BAB＋算法，然而此算法搜索时间比较长。在此基础上详细地阐述改进的分支定界的原理以及算法，该算法的基本思想是通过剪切那些肯定不会产生最优解的分支，同时引入了部分路径和父路径的概念，以达到决策树能够快速搜索到最优解的目的。实验结果证明了该算法的有效性及优越性。
|
| 关 键 词： | 分支定界 搜索树 特征选择 部分路径 |
An improved branch and bound algorithm |
| |
| SUN Shu-liang,CHEN Zhong,LIU Zheng-lian. An improved branch and bound algorithm[J]. Software, 2011, 0(10): 32-34 |
| |
| Authors: | SUN Shu-liang CHEN Zhong LIU Zheng-lian |
| |
| Affiliation: | SUN Shu-liang1,CHEN Zhong1,LIU Zheng-lian1,2(1.Department of Mathematics and Computer Science,Fuqing Branch of Fujian Normal University,Fuqing,350300,China,2.Department of Mathematics,Royal Holloway,University of London,Egham,Surrey,TW20 0EX,UK) |
| |
| Abstract: | How to select optimal features is one of the priority research areas.Currently,BAB and BAB+ algorithms,which are used to select optimal features,are commonly applied.But it takes too long to use convinently.Then theory and algorithm of an improved branch and bound are explained particularly.The essence of this algorithm is to search for an optimal solution in a solution tree.Partial route and Father route are introduced in this paper.The solution tree is got by cutting those unnecessary branches which will ... |
| |
| Keywords: | branch and bound algorithm solution tree feature selection partial route |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
