Adaptive graph learning for semi-supervised feature selection with redundancy minimization
From MaRDI portal
Publication:6203482
Recommendations
- A robust graph-based semi-supervised sparse feature selection method
- Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
- Adaptive discriminant analysis for semi-supervised feature selection
- Unsupervised feature selection through combining graph learning and \(\ell_{2, 0}\)-norm constraint
- A survey on semi-supervised feature selection methods
Cites work
- A General Framework for Auto-Weighted Feature Selection via Global Redundancy Minimization
- A robust graph-based semi-supervised sparse feature selection method
- A survey on optimization metaheuristics
- A survey on semi-supervised feature selection methods
- Adaptive discriminant analysis for semi-supervised feature selection
- Nonnegative self-representation with a fixed rank constraint for subspace clustering
- Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
Cited in
(3)
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)