The Relevance Sample-Feature Machine: A Sparse Bayesian Learning Approach to Joint Feature-Sample Selection

被引:48
|
作者
Mohsenzadeh, Yalda [1 ]
Sheikhzadeh, Hamid [1 ]
Reza, Ali M. [1 ,2 ]
Bathaee, Najmehsadat [1 ]
Kalayeh, Mahdi M. [3 ]
机构
[1] Amirkabir Univ Technol, Dept Elect Engn, Tehran Polytech, Tehran 15914, Iran
[2] Univ Wisconsin, Dept Elect Engn & Comp Sci, Milwaukee, WI 53201 USA
[3] Univ Cent Florida, CRCV, Orlando, FL 32816 USA
关键词
Joint feature selection and classifier design; relevance features; relevance sample feature machine (RSFM); relevance samples; sparse Bayesian learning; VECTOR MACHINES; CLASSIFICATION;
D O I
10.1109/TCYB.2013.2260736
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper introduces a novel sparse Bayesian machine-learning algorithm for embedded feature selection in classification tasks. Our proposed algorithm, called the relevance sample feature machine (RSFM), is able to simultaneously choose the relevance samples and also the relevance features for regression or classification problems. We propose a separable model in feature and sample domains. Adopting a Bayesian approach and using Gaussian priors, the learned model by RSFM is sparse in both sample and feature domains. The proposed algorithm is an extension of the standard RVM algorithm, which only opts for sparsity in the sample domain. Experimental comparisons on synthetic as well as benchmark data sets show that RSFM is successful in both feature selection (eliminating the irrelevant features) and accurate classification. The main advantages of our proposed algorithm are: less system complexity, better generalization and avoiding overfitting, and less computational cost during the testing stage.
引用
收藏
页码:2241 / 2254
页数:14
相关论文
共 50 条
  • [1] Variational Relevant Sample-Feature Machine: A fully Bayesian approach for embedded feature selection
    Mirzaei, Ali
    Mohsenzadeh, Yalda
    Sheikhzadeh, Hamid
    [J]. NEUROCOMPUTING, 2017, 241 : 181 - 190
  • [2] Incremental relevance sample-feature machine: A fast marginal likelihood maximization approach for joint feature selection and classification
    Mohsenzadeh, Yalda
    Sheikhzadeh, Hamid
    Nazari, Sobhan
    [J]. PATTERN RECOGNITION, 2016, 60 : 835 - 848
  • [3] A sparse Bayesian approach for joint feature selection and classifier learning
    Lapedriza, Agata
    Segui, Santi
    Masip, David
    Vitria, Jordi
    [J]. PATTERN ANALYSIS AND APPLICATIONS, 2008, 11 (3-4) : 299 - 308
  • [4] A sparse Bayesian approach for joint feature selection and classifier learning
    Àgata Lapedriza
    Santi Seguí
    David Masip
    Jordi Vitrià
    [J]. Pattern Analysis and Applications, 2008, 11 : 299 - 308
  • [5] Joint Feature-Sample Selection and Robust Classification for Parkinson's Disease Diagnosis
    Adeli-Mosabbeb, Ehsan
    Wee, Chong-Yaw
    An, Le
    Shi, Feng
    Shen, Dinggang
    [J]. MEDICAL COMPUTER VISION: ALGORITHMS FOR BIG DATA, 2016, 9601 : 127 - 136
  • [6] Feature Learning in Feature-Sample Networks using Multi-objective Optimization
    Neto Verri, Filipe Alves
    Tinos, Renato
    Zhao, Liang
    [J]. 2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 1629 - 1635
  • [7] Joint sample and feature selection via sparse primal and dual LSSVM
    Shao, Yuan-Hai
    Li, Chun-Na
    Huang, Ling-Wei
    Wang, Zhen
    Deng, Nai-Yang
    Xu, Yan
    [J]. KNOWLEDGE-BASED SYSTEMS, 2019, 185
  • [8] Joint feature-sample selection and robust diagnosis of Parkinson's disease from MRI data
    Adeli, Ehsan
    Shi, Feng
    An, Le
    Wee, Chong-Yaw
    Wu, Guorong
    Wang, Tao
    Shen, Dinggang
    [J]. NEUROIMAGE, 2016, 141 : 206 - 219
  • [9] Sparse Bayesian Approach for Feature Selection
    Li, Chang
    Chen, Huanhuan
    [J]. 2014 IEEE Symposium on Computational Intelligence in Big Data (CIBD), 2014, : 7 - 13
  • [10] Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient
    Hao, Botao
    Duan, Yaqi
    Lattimore, Tor
    Szepesvari, Csaba
    Wang, Mengdi
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139