Abstract
Multi-view feature selection aims at obtaining a subset of informative features from heterogeneous feature domains. Recent graph based approaches mostly learn view-specific feature selection matrices by virtue of prepared single-view graphs, and weight the view-wise objectives to discriminate them. However, the majority of them encounter that (i) the dimensions of vectors for evaluating features in different views are inconsistent and (ii) the similarities attained by using features in the original high-dimensional space are inferior. As a result, the joint evaluation of heterogeneous features using view-specific selection matrices are inaccurate and immensely depend on ill-defined similarity relations. To overcome them, we propose the Multilevel projections with Adaptive neighbor graph model for unsupervised Multi-view Feature Selection (MAMFS). Our formulation learns the collaborative graph adapting to the adaptive k-nearest neighbors in subspaces, wherein the multilevel projections are involved including the weighted view-specific projections that discriminate different views and the joint projection that collaborates different views. Benefited from this, both of view-within information and the view-across information are jointly explored and made use of. Extensive simulations are conducted to validate the superiority of the proposed method compared to the state-of-the-art competitors.
| Original language | English |
|---|---|
| Pages (from-to) | 129-140 |
| Number of pages | 12 |
| Journal | Information Fusion |
| Volume | 70 |
| DOIs | |
| State | Published - Jun 2021 |
Keywords
- Adaptive neighbor graph
- Joint heterogeneous evaluation
- Multilevel projections
- Unsupervised multi-view feature selection
Fingerprint
Dive into the research topics of 'Multilevel projections with adaptive neighbor graph for unsupervised multi-view feature selection'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver