Adaptive graph learning for semi-supervised feature selection with redundancy minimization

DOI10.1016/J.INS.2022.07.102OpenAlexW4286266907MaRDI QIDQ6203482FDOQ6203482

Jingliu Lai, Xiaoling Yang, Hongmei Chen, Tianrui Li

Publication date: 27 March 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.07.102

zbMATH Keywords

sparse learningsemi-supervised feature selectionadaptive graph learningredundancy minimization regularization

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Computer science (68-XX)

Cites Work

• A survey on optimization metaheuristics
• A survey on semi-supervised feature selection methods
• A robust graph-based semi-supervised sparse feature selection method
• Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
• A General Framework for Auto-Weighted Feature Selection via Global Redundancy Minimization
• Nonnegative self-representation with a fixed rank constraint for subspace clustering
• Adaptive discriminant analysis for semi-supervised feature selection

Cited In (1)

• Sparse orthogonal supervised feature selection with global redundancy minimization, label scaling, and robustness

This page was built for publication: Adaptive graph learning for semi-supervised feature selection with redundancy minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203482)