A robust unsupervised feature selection based on subspace learning and adaptive graph structure

doi:10.22124/jmm.2025.30225.2714

A robust unsupervised feature selection based on subspace learning and adaptive graph structure

2026-03-01

1

PRE

AI

DOI：10.22124/jmm.2025.30225.2714

原文链接

原文求助

摘要

En 中文

selection is vital for improving high-dimensional data analysis by identifying a subset of representative and uncorrelated features. This paper presents an unsupervised feature selection algorithm based on subspace learning and adaptive graph structure (UFSAG). The UFSAG uses matrix factorization to preserve global data structure and incorporates local correlations into its objective function. It also integrates sample similarity graph learning to maintain data geometry. Unlike prior methods, UFSAG employs adaptive local structure learning to reduce noise and enhance feature selection. By inducing row sparsity in the feature coefficient matrix using the & ell;2,1-norm, UFSAG identifies representative features. Comparative experiments on six datasets show UFSAG's superior clustering performance over twelve state-of-the-art methods.

Keyword:

Matrix factorization

feature selection

local correlation

data manifold

clustering

A robust unsupervised feature selection based on subspace learning and adaptive graph structure

摘要

期刊

机构

引用论文