An empirical study of feature selection in support vector machines

被引:0
作者
Cao, L. J. [1 ]
Zhang Jingqing [1 ]
机构
[1] Fudan Univ, Shanghai 200433, Peoples R China
关键词
feature selection; support vector machines; structural risk minimization principle; saliency analysis; genetic algorithm;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, a support vector machine (SVM) has been receiving increasing attention in the field of regression estimation due to its remarkable characteristics such as good generalization performance, the absence of local minima and sparse representation of the solution. However, within the SVMs framework, there are very few established approaches for identifying important features. Selecting significant features from all candidate features is the first step in regression estimation, and this procedure can improve the network performance, reduce the network complexity, and speed up the training of the network. This paper investigates the use of saliency analysis (SA) and genetic algorithm (GA) in SVMs for selecting important features in the context of regression estimation. The SA measures the importance of features by evaluating the sensitivity of the network output with respect to the feature input. The derivation of the sensitivity of the network output to the feature input in terms of the partial derivative in SVMs is presented, and a systematic approach to remove irrelevant features based on the sensitivity is developed. GA is an efficient search, method based on the mechanics of natural selection and population genetics. A simple GA is used where all features are mapped into binary chromosomes with a bit "1" representing the inclusion of the feature and a bit of "0" representing the absence of the feature. The performances of SA and GA are tested using two simulated non-linear time series and five real financial time series. The experiments show that with the simulated data, GA and SA detect the same true feature set from the redundant feature set, and the method of SA is also insensitive to the kernel function selection. With the real financial data, GA and SA select different subsets of the features. Both selected feature sets achieve higher generation performance in SVMs than that of the full feature set. In addition, the generation performance between the selected feature sets of GA and SA is similar. All the results demonstrate that that both S A and GA are effective in the SVMs for identifying important features.
引用
收藏
页码:433 / 453
页数:21
相关论文
共 37 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]  
[Anonymous], 1982, Introduction to Linear Regression Analysis
[3]   Neural networks and genetic algorithms for bankruptcy predictions [J].
Back, B ;
Laitinen, T ;
Sere, K .
EXPERT SYSTEMS WITH APPLICATIONS, 1996, 11 (04) :407-413
[4]   On domain knowledge and feature selection using a support vector machine [J].
Barzilay, O ;
Brailovsky, VL .
PATTERN RECOGNITION LETTERS, 1999, 20 (05) :475-484
[5]   DETERMINING INPUT FEATURES FOR MULTILAYER PERCEPTRONS [J].
BELUE, LM ;
BAUER, KW .
NEUROCOMPUTING, 1995, 7 (02) :111-121
[6]   FAST GENETIC SELECTION OF FEATURES FOR NEURAL NETWORK CLASSIFIERS [J].
BRILL, FZ ;
BROWN, DE ;
MARTIN, WN .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1992, 3 (02) :324-328
[7]  
Chtioui Y, 1998, J SCI FOOD AGR, V76, P77, DOI 10.1002/(SICI)1097-0010(199801)76:1&lt
[8]  
77::AID-JSFA948&gt
[9]  
3.0.CO
[10]  
2-9