Graph–Regularized Consensus Learning and Diversity Representation for unsupervised multi-view feature selection

In the existing data dimensionality reduction methods, unsupervised multi-view feature selection has been widely adopted for its effectiveness. However, most of the current methods lack sufficient integration of consensus and complementarity principles. On the one hand, some methods focus solely on the consensus representation of multiple views and neglect the inter-view complementarity and the uniqueness of each view. On the other hand, some methods obtain intrinsic representation matrices for each view and combine them crudely to form the final result, which fails to exploit complementary information among views. Inspired by these two aspects, this paper proposes the Graph-Regularized Consensus Learning and Diversity Representation (GCDUFS) for unsupervised multi-view feature selection. The algorithm leverages graph regularization to constrain the consensus matrix, better capturing common manifold information. It also utilizes kernel functions to measure the dependency of the data in the Hilbert space , effectively capturing the diverse information across all views. Additionally, symmetric non-negative matrix factorization (SNMF) is employed for clustering analysis . The above-mentioned methods are smoothly integrated into a unified model framework, and the GCDUFS algorithm is optimized using the alternating direction method of multipliers (ADMM) minimization strategy. Through the analysis of nine multi-view datasets, we conducted comprehensive clustering experiments and verified that our proposed method outperforms several state-of-the-art competitors in terms of performance.