Adaptive Collaborative Similarity Learning for Unsupervised Multi-view Feature Selection
Not on the map. Why?
Abstract (arXiv)
In this paper, we investigate the research problem of unsupervised multi-view feature selection. Conventional solutions first simply combine multiple pre-constructed view-specific similarity structures into a collaborative similarity structure, and then perform the subsequent feature selection. These two processes are separate and independent. The collaborative similarity structure remains fixed during feature selection. Further, the simple undirected view combination may adversely reduce the reliability of the ultimate similarity structure for feature selection, as the view-specific similarity structures generally involve noises and outlying entries. To alleviate these problems, we propose an adaptive collaborative similarity learning (ACSL) for multi-view feature selection. We propose to dynamically learn the collaborative similarity structure, and further integrate it with the ultimate feature selection into a unified framework. Moreover, a reasonable rank constraint is devised to adaptively learn an ideal collaborative similarity structure with proper similarity combination weights and desirable neighbor assignment, both of which could positively facilitate the feature selection. An effective solution guaranteed with the proved convergence is derived to iteratively tackle the formulated optimization problem. Experiments demonstrate the superiority of the proposed approach.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
5 papers.
- 2022Joint Multi-view Unsupervised Feature Selection and Graph Learningcited by 10
- 2025Revisiting Dynamic Graph Clustering via Matrix Factorizationcited by 7
- 2022C2IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selectioncited by 1
- 2026Node Role-Guided LLMs for Dynamic Graph Clusteringcited by 1
- 2022Incremental Unsupervised Feature Selection for Dynamic Incomplete Multi-view Datacited by 0
- 2026Node Role-Guided LLMs for Dynamic Graph Clustering14 Mar 2026
- 2025Revisiting Dynamic Graph Clustering via Matrix Factorization10 Feb 2025
- 2022C2IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection20 Aug 2022
- 2022Joint Multi-view Unsupervised Feature Selection and Graph Learning18 Apr 2022
- 2022Incremental Unsupervised Feature Selection for Dynamic Incomplete Multi-view Data5 Apr 2022