A novel feature selection method for twin support vector machine

被引:31
|
作者
Bai, Lan [1 ]
Wang, Zhen [1 ]
Shao, Yuan-Hai [2 ]
Deng, Nai-Yang [3 ]
机构
[1] Jilin Univ, Sch Math, Changchun 130012, Peoples R China
[2] Zhejiang Univ Technol, Zhijiang Coll, Hangzhou 310024, Zhejiang, Peoples R China
[3] China Agr Univ, Coll Sci, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
Pattern recognition; Feature selection; Twin support vector machine; Feature ranking; L-1; norm; Multi-objective mixed-integer programming; CLASSIFICATION; ALGORITHM; KERNEL; TREE;
D O I
10.1016/j.knosys.2014.01.025
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Both support vector machine (SVM) and twin support vector machine (TWSVM) are powerful classification tools. However, in contrast to many SVM-based feature selection methods, TWSVM has not any corresponding one due to its different mechanism up to now. In this paper, we propose a feature selection method based on TWSVM, called FTSVM. It is interesting because of the advantages of TWSVM in many cases. Our FTSVM is quite different from the SVM-based feature selection methods. In fact, linear SVM constructs a single separating hyperplane which corresponds a single weight for each feature, whereas linear TWSVM constructs two fitting hyperplanes which corresponds to two weights for each feature. In our linear FTSVM, in order to link these two fitting hyperplanes, a feature selection matrix is introduced. Thus, the feature selection becomes to find an optimal matrix, leading to solve a multi-objective mixed-integer programming problem by a greedy algorithm. In addition, the linear FTSVM has been extended to the nonlinear case. Furthermore, a feature ranking strategy based on FTSVM is also suggested. The experimental results on several public available benchmark datasets indicate that our FTSVM not only gives nice feature selection on both linear and nonlinear cases but also improves the performance of TWSVM efficiently. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 50 条
  • [1] A Feature Selection Method for Projection Twin Support Vector Machine
    A. Rui Yan
    B. Qiaolin Ye
    C. Liyan Zhang
    D. Ning Ye
    E. Xiangbo Shu
    [J]. Neural Processing Letters, 2018, 47 : 21 - 38
  • [2] A Feature Selection Method for Projection Twin Support Vector Machine
    Yan, A. Rui
    Ye, B. Qiaolin
    Zhang, C. Liyan
    Ye, D. Ning
    Shu, E. Xiangbo
    [J]. NEURAL PROCESSING LETTERS, 2018, 47 (01) : 21 - 38
  • [3] A novel feature selection method based on quantum support vector machine
    Wang, Haiyan
    [J]. PHYSICA SCRIPTA, 2024, 99 (05)
  • [4] Feature selection for least squares projection twin support vector machine
    Guo, Jianhui
    Yi, Ping
    Wang, Ruili
    Ye, Qiaolin
    Zhao, Chunxia
    [J]. NEUROCOMPUTING, 2014, 144 : 174 - 183
  • [5] A feature selection Newton method for support vector machine classification
    Fung, GM
    Mangasarian, OL
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2004, 28 (02) : 185 - 202
  • [6] A Feature Selection Newton Method for Support Vector Machine Classification
    Glenn M. Fung
    O.L. Mangasarian
    [J]. Computational Optimization and Applications, 2004, 28 : 185 - 202
  • [7] Regularization feature selection projection twin support vector machine via exterior penalty
    Yi, Ping
    Song, Aiguo
    Guo, Jianhui
    Wang, Ruili
    [J]. NEURAL COMPUTING & APPLICATIONS, 2017, 28 : S683 - S697
  • [8] Regularization feature selection projection twin support vector machine via exterior penalty
    Ping Yi
    Aiguo Song
    Jianhui Guo
    Ruili Wang
    [J]. Neural Computing and Applications, 2017, 28 : 683 - 697
  • [9] Novel Feature Selection Method for Nonlinear Support Vector Regression
    Xu, Kejia
    Xu, Ying
    Ye, Yafen
    Chen, Weijie
    [J]. COMPLEXITY, 2022, 2022
  • [10] Feature Selection Based on Twin Support Vector Regression
    Wu, Qing
    Zhang, Haoyi
    Jing, Rongrong
    Li, Yiran
    [J]. 2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 2903 - 2907