A robust graph-based semi-supervised sparse feature selection method

DOI10.1016/j.ins.2020.03.094zbMath1459.68176OpenAlexW3022782153MaRDI QIDQ2023155

Razieh Sheikhpour, Sajjad Gharaghani, Mehdi Agha Sarram, Mohammad Ali Zare Chahooki

Publication date: 3 May 2021

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

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

zbMATH Keywords

semi-supervised learninggraph Laplacian\(l_{2,p}\)-normsparse feature selection

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Statistics on manifolds (62R30) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

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

Cites Work

• Trace ratio criterion based generalized discriminative learning for semi-supervised dimensionality reduction
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
• A survey on semi-supervised feature selection methods
• Semi-supervised linear discriminant analysis for dimension reduction and classification
• L 1/2 regularization
• Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A robust graph-based semi-supervised sparse feature selection method