Self-paced regularized adaptive multi-view unsupervised feature selection

Xuanhao Yang; Hangjun Che; Man-Fai Leung; Shiping Wen

doi:10.1016/j.neunet.2024.106295

Self-paced regularized adaptive multi-view unsupervised feature selection

Neural Netw. 2024 Apr 6:175:106295. doi: 10.1016/j.neunet.2024.106295. Online ahead of print.

Authors

Xuanhao Yang¹, Hangjun Che², Man-Fai Leung³, Shiping Wen⁴

Affiliations

¹ College of Electronic and Information Engineering, Southwest University, Chongqing, 400715, China. Electronic address: xhyang0121@foxmail.com.
² College of Electronic and Information Engineering, Southwest University, Chongqing, 400715, China; Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing, Chongqing, 400715, China. Electronic address: hjche123@swu.edu.cn.
³ School of Computing and Information Science, Faculty of Science and Engineering, Anglia Ruskin University, Cambridge, UK. Electronic address: man-fai.leung@aru.ac.uk.
⁴ Faculty of Engineering and Information Technology, Australian Artificial Intelligence Institute, University of Technology Sydney, Sydney, NSW 2007, Australia. Electronic address: Shiping.Wen@uts.edu.au.

PMID: 38614023
DOI: 10.1016/j.neunet.2024.106295

Abstract

Multi-view unsupervised feature selection (MUFS) is an efficient approach for dimensional reduction of heterogeneous data. However, existing MUFS approaches mostly assign the samples the same weight, thus the diversity of samples is not utilized efficiently. Additionally, due to the presence of various regularizations, the resulting MUFS problems are often non-convex, making it difficult to find the optimal solutions. To address this issue, a novel MUFS method named Self-paced Regularized Adaptive Multi-view Unsupervised Feature Selection (SPAMUFS) is proposed. Specifically, the proposed approach firstly trains the MUFS model with simple samples, and gradually learns complex samples by using self-paced regularizer. l_2,p-norm (0<p≤1) is employed to measure the learning error and as the sparse regularization to accommodate various sparsity requirements across different datasets. Moreover, hypergraph Laplacian matrices are constructed for each view to better preserve the local manifold structure and encode high-order relationships within the data space. They are adaptively assigned weights to learn the underlying correlated and diverse information among different views. An iterative optimization algorithm is proposed to solve SPAMUFS and the convergence and computational complexity are also analyzed. The effectiveness of SPAMUFS is substantiated by comparing with eight state-of-the-art algorithms on nine public multi-view datasets.

Keywords: Hypergraph; Multi-view unsupervised feature selection; Self-paced learning; Sparse learning; l(2,p)-norm.