.png){kind=icon}
返回
Adaptive branch and bound algorithm for selecting optimal features
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2007.02.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a new adaptive branch and bound algorithm for selecting the optimal subset of features in pattern recognition applications. The algorithm improves the search speed by avoiding unnecessary criterion function calculations at nodes in the solution tree. Our algorithm includes the following new properties: (i) ordering the tree nodes by the significance of features during construction of the tree, Oil obtaining a large good initial bound by a floating search method, (iii) a new method to select an initial starting search level in the tree. and (iv) a new adaptive jump search strategy to select subsequent search levels to avoid redundant criterion function calculations. Our experimental results for four different databases demonstrate that our method is significantly faster than other versions of the branch and bound algorithm when the database has more than 30 features. (c) 2007 Elsevier B.V.. All rights reserved.
Keyword:
branch and bound algorithm
dimensionality reduction
feature selection
optimal subset search
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks
OAAI
OAAI分享收藏ALDH1A1 Deficiency in Gorlin Syndrome Suggests a Central Role for Retinoic Acid and ATM Deficits in Radiation Carcinogenesis.png)
ProteomesOAAI
ProteomesIF0
OAAI分享收藏Comparison of algorithms that select features for pattern classifiers模式分类器特征选择算法的比较PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容