Semi-supervised sparse feature selection via graph Laplacian based scatter matrix for regression problems
DOI10.1016/J.INS.2018.08.035zbMATH Open1450.62080OpenAlexW2887785120WikidataQ129393031 ScholiaQ129393031MaRDI QIDQ2200628FDOQ2200628
Authors: Razieh Sheikhpour, Mehdi Agha Sarram, Elnaz Sheikhpour
Publication date: 22 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.08.035
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
General nonlinear regression (62J02) Applications of statistics to biology and medical sciences; meta analysis (62P10) (S)-matrix theory, etc. in quantum theory (81U20)
Cites Work
Cited In (8)
- A robust graph-based semi-supervised sparse feature selection method
- 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
- Ensemble of semi-supervised feature selection algorithms to reinforce heuristic function in ant colony optimization
- Sparse and robust estimation with ridge minimax concave penalty
- Discriminative sparse least square regression for semi-supervised learning
Uses Software
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)