Discriminative and Robust Autoencoders for Unsupervised Feature Selection

被引:3
|
作者
Ling, Yunzhi [1 ,2 ]
Nie, Feiping [1 ,2 ,3 ]
Yu, Weizhong [2 ]
Li, Xuelong [2 ,3 ]
机构
[1] Northwestern Polytech Univ, Sch Comp Sci, Xian 710072, Shaanxi, Peoples R China
[2] Northwestern Polytech Univ, Sch Artificial Intelligence Opt & Elect iOPEN, Xian 710072, Shaanxi, Peoples R China
[3] Northwestern Polytech Univ, Key Lab Intelligent Interact & Applicat, Minist Ind & Informat Technol, Xian 710072, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature extraction; Data models; Robustness; Representation learning; Optics; Clustering algorithms; Training data; Autoencoders (AEs); clustering; feature selection; neural networks; robustness; unsupervised learning; CLASSIFICATION;
D O I
10.1109/TNNLS.2023.3333737
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many recent research works on unsupervised feature selection (UFS) have focused on how to exploit autoencoders (AEs) to seek informative features. However, existing methods typically employ the squared error to estimate the data reconstruction, which amplifies the negative effect of outliers and can lead to performance degradation. Moreover, traditional AEs aim to extract latent features that capture intrinsic information of the data for accurate data recovery. Without incorporating explicit cluster structure-detecting objectives into the training criterion, AEs fail to capture the latent cluster structure of the data which is essential for identifying discriminative features. Thus, the selected features lack strong discriminative power. To address the issues, we propose to jointly perform robust feature selection and k-means clustering in a unified framework. Concretely, we exploit an AE with a l2,1-norm as a basic model to seek informative features. To improve robustness against outliers, we introduce an adaptive weight vector for the data reconstruction terms of AE, which assigns smaller weights to the data with larger errors to automatically reduce the influence of the outliers, and larger weights to the data with smaller errors to strengthen the influence of clean data. To enhance the discriminative power of the selected features, we incorporate k-means clustering into the representation learning of the AE. This allows the AE to continually explore cluster structure information, which can be used to discover more discriminative features. Then, we also present an efficient approach to solve the objective of the corresponding problem. Extensive experiments on various benchmark datasets are provided, which clearly demonstrate that the proposed method outperforms state-of-the-art methods.
引用
收藏
页码:1622 / 1636
页数:15
相关论文
共 50 条
  • [21] Fast Sparse Discriminative K-Means for Unsupervised Feature Selection
    Nie, Feiping
    Ma, Zhenyu
    Wang, Jingyu
    Li, Xuelong
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (07) : 9943 - 9957
  • [22] Joint Adaptive Graph Learning and Discriminative Analysis for Unsupervised Feature Selection
    Haifeng Zhao
    Qi Li
    Zheng Wang
    Feiping Nie
    Cognitive Computation, 2022, 14 : 1211 - 1221
  • [23] Discriminative and Uncorrelated Feature Selection With Constrained Spectral Analysis in Unsupervised Learning
    Li, Xuelong
    Zhang, Han
    Zhang, Rui
    Nie, Feiping
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2020, 29 (01) : 2139 - 2149
  • [24] Joint Adaptive Graph Learning and Discriminative Analysis for Unsupervised Feature Selection
    Zhao, Haifeng
    Li, Qi
    Wang, Zheng
    Nie, Feiping
    COGNITIVE COMPUTATION, 2022, 14 (03) : 1211 - 1221
  • [25] Discriminative sparse subspace learning and its application to unsupervised feature selection
    Zhou, Nan
    Cheng, Hong
    Pedrycz, Witold
    Zhang, Yong
    Liu, Huaping
    ISA TRANSACTIONS, 2016, 61 : 104 - 118
  • [26] Robust inner product regularized unsupervised feature selection
    Qian, Youcheng
    Yin, Xueyan
    Gao, Wei
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (23) : 33593 - 33615
  • [27] Adaptive unsupervised feature selection with robust graph regularization
    Zhiwen Cao
    Xijiong Xie
    Feixiang Sun
    International Journal of Machine Learning and Cybernetics, 2024, 15 : 341 - 354
  • [28] Adaptive unsupervised feature selection with robust graph regularization
    Cao, Zhiwen
    Xie, Xijiong
    Sun, Feixiang
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2024, 15 (02) : 341 - 354
  • [29] Robust Sparse Subspace Learning for Unsupervised Feature Selection
    Wang, Feng
    Rao, Qi
    Zhang, Yongquan
    Chen, Xu
    2016 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2016, : 4205 - 4212
  • [30] Robust unsupervised feature selection via matrix factorization
    Du, Shiqiang
    Ma, Yide
    Li, Shouliang
    Ma, Yurun
    NEUROCOMPUTING, 2017, 241 : 115 - 127