Bi-Sparse Unsupervised Feature Selection

doi:10.1109/TIP.2025.3620667

Bi-Sparse Unsupervised Feature Selection

2025-01-01

0

PRE

AI

DOI：10.1109/TIP.2025.3620667

Original

Original request for help

Save

Abstract

En 中文

To deal with high-dimensional unlabeled datasets in many areas, principal component analysis (PCA) has become a rising technique for unsupervised feature selection (UFS). However, most existing PCA-based methods only consider the structure of datasets by embedding a single sparse regularization or constraint on the transformation matrix. In this paper, we introduce a novel bi-sparse method called BSUFS to improve the performance of UFS. The core idea of BSUFS is to incorporate $\ell _{2,p}$ -norm and $\ell _{q}$ -norm into the classical PCA, which enables our method to select relevant features and filter out irrelevant noises, thereby obtaining discriminative features. Here, the parameters $p$ and $q$ are within the range of [ $0, 1$ ). Therefore, BSUFS not only constructs a unified framework for bi-sparse optimization, but also includes some existing works as special cases. To solve the resulting non-convex model, we propose an efficient proximal alternating minimization (PAM) algorithm using Stiefel manifold optimization and sparse optimization techniques. In addition, the computational complexity analysis is presented. Extensive numerical experiments on synthetic and real-world datasets demonstrate the effectiveness of our proposed BSUFS. The results reveal the advantages of bi-sparse optimization in feature selection and show its potential for other fields in image processing. Our code is available at https://github.com/xianchaoxiu/BSUFS.

Keywords:

Unsupervised feature selection

bi-sparse

principal component analysis

proximal alternating minimization

manifold optimization

Bi-Sparse Unsupervised Feature Selection

Abstract

Journal

Organization

Cited Papers