arrow
Return

Unsupervised feature selection with evolutionary sparsity

delete2025-06-07
delete0
PRE
AI
S
Shixuan Zhou
H
Han Huang
P
Pei Huang *
C
Chaoda Peng
杨晓伟 cover
杨晓伟 (Xiaowei Yang)
宋
宋鹏 (Peng Song)
DOI:10.1016/j.neunet.2025.107512delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The t2,0-norm is playing an increasingly important role in unsupervised feature selection. However, existing algorithm for optimization problem with t2,0-norm constraint has two problems: First, they cannot automatically determine the sparsity, also known as the number of key features. Second, they have the risk of converging towards local optima, therefore selecting trivial (less informative) features. To address these problems, this paper proposes an unsupervised feature selection method with evolutionary sparsity (EVSP), which integrates the feature selection process with a sparse projection matrix and population search mechanisms into a unified unsupervised feature selection framework. Specifically, the level of sparsity is encoded as population individuals, and subsequently, a multi-objective evolutionary algorithm based on binary encoding is introduced to recursively determine the optimal level of sparsity, thus unsupervisedly guiding the learning of an optimal row-sparse projection matrix. Moreover, by utilizing the feature weights learned through sparse projection, a two-stage strategy called the mutation-repair operator is designed to steer the evolution of the population, aiming to generate high-quality candidate solutions. Comprehensive experiments on eleven benchmark datasets, with a maximum dimensionality of 10304 features and a maximum size of 9298 samples, demonstrate that the proposed EVSP method can effectively determine the optimal sparsity level, significantly outperforming several state-of-the-art methods.
Keywords:
Unsupervised feature selection
Multi-objective evolution
Sparse projection

Journal

Neural Networks cover
Neural Networks
IF:
6.3
Papers:
8.2K
Citations:
3.0W

Organization

G
Guangdong University of Finance and Economics
Scholars:
249
Papers: 171
Citations: 28
Cited Papers

Cited Papers

errShare
errSave
Clean affinity matrix induced hyper-Laplacian regularization for unsupervised multi-view feature selection
err2024-11-01
err0
PREAI
errPeng Song; Shixuan Zhou; Jinshuai Mu; Meng Duan; Yanwei Yu; Wenming Zheng
errShare
errSave
researcher View more