.png){kind=icon}
.png){kind=icon}
Return
Autoweighted Multiview Feature Selection With Graph Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2021.3094843.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we focus on the unsupervised multiview feature selection, which tries to handle high-dimensional data in the field of multiview learning. Although some graph-based methods have achieved satisfactory performance, they ignore the underlying data structure across different views. Besides, their predefined Laplacian graphs are sensitive to the noises in the original data space and fail to obtain the optimal neighbor assignment. To address the above problems, we propose a novel unsupervised multiview feature selection model based on graph learning, and the contributions are three-fold: 1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Therefore, the proposed model can reveal the data relationship from the feature subset; 2) a reasonable rank constraint is added to optimize the similarity matrix to obtain more accurate information; and 3) an autoweighted framework is presented to assign view weights adaptively, and an effective alternative iterative algorithm is proposed to optimize the problem. Experiments on various datasets demonstrate the superiority of the proposed method compared to the state-of-the-art methods.
Keywords:
Feature extraction
Task analysis
Laplace equations
Optimization
Data structures
Data models
Sparse matrices
Adaptive view weight
machine learning
multiview learning
optimal similarity matrix
unsupervised feature selection
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W