Robust supervised multi-view feature selection with weighted shared loss and maximum margin criterion

被引:15
|
作者
Lin, Qiang [1 ]
Yang, Liran [2 ]
Zhong, Ping [1 ]
Zou, Hui [1 ]
机构
[1] China Agr Univ, Coll Sci, Beijing 100083, Peoples R China
[2] China Agr Univ, Coll Informat & Elect Engn, Beijing 100083, Peoples R China
关键词
Multi-view learning; Weighted shared loss; Maximum margin criterion; Robust; Feature selection; ALTERNATING DIRECTION METHOD; CLASSIFICATION; FUSION;
D O I
10.1016/j.knosys.2021.107331
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Supervised multi-view feature selection has recently been proven to be a valid way for reducing the dimensionality of data. This paper proposes a robust supervised multi-view feature selection method based on weighted shared loss and maximum margin criterion. Specifically, we fuse all weighted views to establish a shared loss term to maintain the complementary information of views, where the weight of each view can be automatically adjusted according to its contribution to the final task. Moreover, we adopt the capped l(2)-norm rather than the widely used l(2)-norm to measure the loss and remove the potential outliers. Further, we introduce the maximum margin criterion (MMC) into the feature selection and design a weighted view-based MMC such that it is a proper regularization associated with the proposed model. In this way, the inter-class and intra-class structure information of data is well exploited, which makes the margins of the samples belonging to the different classes increase and the margins of the samples belonging the same class decrease. Then the discriminative features of all views can be selected. The corresponding problem can be solved by the alternating direction method of multipliers (ADMM), which can realize the view-block calculation and reduce the computational complexity. Comprehensive experiments on various benchmark datasets and the application on the hydraulic system confirm the validity of our method. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] Robust Re-Weighted Multi-View Feature Selection
    Xue, Yiming
    Wang, Nan
    Yan, Niu
    Zhong, Ping
    Niu, Shaozhang
    Song, Yuntao
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2019, 60 (02): : 741 - 756
  • [2] Robust Multi-View Feature Selection
    Liu, Hongfu
    Mao, Haiyi
    Fu, Yun
    [J]. 2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2016, : 281 - 290
  • [3] Structured sparse multi-view feature selection based on weighted hinge loss
    Nan Wang
    Yiming Xue
    Qiang Lin
    Ping Zhong
    [J]. Multimedia Tools and Applications, 2019, 78 : 15455 - 15481
  • [4] Structured sparse multi-view feature selection based on weighted hinge loss
    Wang, Nan
    Xue, Yiming
    Lin, Qiang
    Zhong, Ping
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (11) : 15455 - 15481
  • [5] Weighted Multi-view Clustering with Feature. Selection
    Xu, Yu-Meng
    Wang, Chang-Dong
    Lai, Jian-Huang
    [J]. PATTERN RECOGNITION, 2016, 53 : 25 - 35
  • [6] Structured Multi-view Supervised Feature Selection Algorithm Research
    Shi, Caijuan
    Zhao, Li-Li
    Liu, Liping
    Liu, Jian
    Tian, Qi
    [J]. COMPUTER VISION, PT II, 2017, 772 : 149 - 157
  • [7] Efficient multi-view semi-supervised feature selection
    Zhang, Chenglong
    Jiang, Bingbing
    Wang, Zidong
    Yang, Jie
    Lu, Yangfeng
    Wu, Xingyu
    Sheng, Weiguo
    [J]. INFORMATION SCIENCES, 2023, 649
  • [8] Kappa Based Weighted Multi-View Clustering with Feature Selection
    Zhu, Changming
    [J]. PROCEEDINGS OF 2018 INTERNATIONAL CONFERENCE ON COMPUTING AND PATTERN RECOGNITION (ICCPR 2018), 2018, : 50 - 54
  • [9] Efficient and robust feature extraction by maximum margin criterion
    Li, HF
    Jiang, T
    Zhang, KH
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16, 2004, 16 : 97 - 104
  • [10] Efficient and robust feature extraction by maximum margin criterion
    Liu, Jun
    Cheri, Songcan
    Tan, Xiaoyang
    Zhang, Daoqiang
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2007, 18 (06): : 1862 - 1864