Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
From MaRDI portal
Publication:2200628
Recommendations
- A robust graph-based semi-supervised sparse feature selection method
- A survey on semi-supervised feature selection methods
- Feature selection in the Laplacian support vector machine
- A semisupervised feature selection with support vector machine
- The performance of semi-supervised Laplacian regularized regression with the least square loss
Cites work
Cited in
(8)- HesGCN: Hessian graph convolutional networks for semi-supervised classification
- Weighted co-association rate-based Laplacian regularized label description for semi-supervised regression
- Target redirected regression with dynamic neighborhood structure
- Adaptive graph learning for semi-supervised feature selection with redundancy minimization
- Sparse and robust estimation with ridge minimax concave penalty
- A robust graph-based semi-supervised sparse feature selection method
- Discriminative sparse least square regression for semi-supervised learning
- Ensemble of semi-supervised feature selection algorithms to reinforce heuristic function in ant colony optimization
This page was built for publication: Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200628)