Feature selection using tabu search method |
| |
Authors: | Hongbin Zhang Guangyu Sun |
| |
Affiliation: | Computer Institute of Beijing Polytechnic University, West San Huan North Road 56, 6#9 Beijing 100044, People's Republic of China |
| |
Abstract: | Selecting an optimal subset from original large feature set in the design of pattern classifier is an important and difficult problem. In this paper, we use tabu search to solve this feature selection problem and compare it with classic algorithms, such as sequential methods, branch and bound method, etc., and most other suboptimal methods proposed recently, such as genetic algorithm and sequential forward (backward) floating search methods. Based on the results of experiments, tabu search is shown to be a promising tool for feature selection in respect of the quality of obtained feature subset and computation efficiency. The effects of parameters in tabu search are also analyzed by experiments. |
| |
Keywords: | Feature selection Tabu search Pattern classifier Search methods Curse of dimensionality |
本文献已被 ScienceDirect 等数据库收录! |
|