Feature selection using tabu search with long-term memories and probabilistic neural networks

被引:36
作者
Wang, Yong [1 ,2 ]
Li, Lin [1 ]
Ni, Jun [1 ]
Huang, Shuhong [2 ]
机构
[1] Univ Michigan, Dept Mech Engn, Ann Arbor, MI 48105 USA
[2] Huazhong Univ Sci & Technol, Sch Energy & Power Engn, Wuhan 430074, Peoples R China
关键词
Feature selection; Tabu Search; Probabilistic neural network; Curse of dimensionality; Smoothing parameter; BOUND ALGORITHM; BRANCH;
D O I
10.1016/j.patrec.2009.02.001
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Feature selection is a dimensionality reduction problem in order to reduce measurement costs, shorten computational time, relieve the curse of dimensionality. and improve classification accuracy. In this paper, a hybrid approach using tabu search and probabilistic neural networks is proposed and applied to feature selection problems. The proposed tabu search algorithm differs from previous research by using a long-term memory instead of a short-term memory to avoid the necessity of the delicate tuning of the memory length and to decrease the risk of generating a cycle that traps the search in local optimal Solutions. The probabilistic neural networks integrated in the proposed hybrid approach are an outgrowth of Bayesian classifiers that outperform backpropagation-based neural networks in their global convergence and rapid training. Extensive experiments on real-world data sets are performed and the comparison with previous research indicates that the proposed hybrid approach can select an equal or smaller number of features while improving classification accuracy. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:661 / 670
页数:10
相关论文
共 28 条
[1]
[Anonymous], Journal of machine learning research
[2]
Asuncion A., 2007, UCI Machine Learning Repository
[3]
Generalized multiscale radial basis function networks [J].
Billings, Stephen A. ;
Wei, Hua-Liang ;
Balikhin, Michael A. .
NEURAL NETWORKS, 2007, 20 (10) :1081-1094
[4]
Bishop Christopher M, 1995, Neural networks for pattern recognition
[5]
NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[6]
POSSIBLE ORDERINGS IN MEASUREMENT SELECTION PROBLEM [J].
COVER, TM ;
VANCAMPENHOUT, JM .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1977, 7 (09) :657-661
[7]
FEATURE-SELECTION FOR AUTOMATIC CLASSIFICATION OF NON-GAUSSIAN DATA [J].
FOROUTAN, I ;
SKLANSKY, J .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1987, 17 (02) :187-198
[8]
FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE [J].
GLOVER, F .
COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) :533-549
[9]
Glover F., 1997, TABU SEARCH
[10]
HUANG CJ, 2003, P 15 IEEE INT C TOOL