Unsupervised feature selection by learning exponential weights

doi:10.1016/j.patcog.2023.110183

Unsupervised feature selection by learning exponential weights

2024-04-01

6

PRE

AI

DOI：10.1016/j.patcog.2023.110183

Original

Original request for help

Save

Abstract

En 中文

Unsupervised feature selection has gained considerable attention for extracting valuable features from unla-beled datasets. Existing approaches typically rely on sparse mapping matrices to preserve local neighborhood structures. However, this strategy favors large-weight features, potentially overlooking smaller yet valuable ones and distorting data distribution and feature structure. Besides, some methods focus on local structure information, failing to explore global information. To address these limitations, we introduce an exponential weighting mechanism to induce a rational feature distribution and explore data structure in the feature subspace. Specifically, we propose a unified framework incorporating local structure learning and exponen-tially weighted sparse regression for optimal feature combinations, preserving global and local information. Experimental results demonstrate the superiority of our approach over existing unsupervised feature selection methods.

Keywords:

Unsupervised feature selection

Sparse regression

Local structure learning

Global information preservation

Unsupervised feature selection by learning exponential weights

Abstract

Journal

Organization