Nonnegative graph embedding induced unsupervised feature selection

doi:10.1016/j.eswa.2025.127664

Nonnegative graph embedding induced unsupervised feature selection

2025-07-01

0

PRE

AI

DOI：10.1016/j.eswa.2025.127664

Original

Original request for help

Save

Abstract

En 中文

Recently, many unsupervised feature selection (UFS) methods have been developed due to their effectiveness in selecting valuable features to improve and accelerate the subsequent learning tasks. However, most existing UFS methods suffer from the following three drawbacks: (1) They usually ignore the nonnegative attribute of feature when conducting feature selection, which inevitably loses partial information; (2) Most adopt a separate strategy to rank all features and then select the first k features, which introduces an additional parameter and often obtains suboptimal results; (3) Most generally confront the problem of high time-consuming. To tackle the previously mentioned shortage, we present a novel UFS method, i.e., Nonnegative Graph Embedding Induced Unsupervised Feature Selection, which considers nonnegative feature attributes and selects informative feature subsets in a one-step way. Specifically, the raw data are projected into a low-dimensional subspace, where the learned low-dimensional representation keeps a nonnegative attribute. Then, a novel scheme is designed to preserve the local geometric structure of the original data, and l(2,0) norm is introduced to guide feature selection without ranking and selecting processes. Finally, we design a high-efficiency solution strategy with low computational complexity, and experiments on real-life datasets verify the efficiency and advancement compared with advanced UFS methods.

Keywords:

Unsupervised feature selection

Nonnegative attribute

One-step way

l(2,0) norm

Low computational complexity

Nonnegative graph embedding induced unsupervised feature selection

Abstract

Journal

Organization