Structured sparse support vector machine with ordered features
From MaRDI portal
Recommendations
- Learning with Structured Sparsity
- A sequential algorithm for sparse support vector classifiers
- Structured variable selection in support vector machines
- Efficient sparse least squares support vector machines for pattern classification
- Sparse kernel machine regression for ordinal outcomes
- Improved sparse least-squares support vector machines
- 10.1162/153244303322753643
Cites work
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- A fast unified algorithm for solving group-lasso penalize learning problems
- A finite newton method for classification
- Gene selection for cancer classification using support vector machines
- High dimensional inverse covariance matrix estimation via linear programming
- High-dimensional classification using features annealed independence rules
- Nearly unbiased variable selection under minimax concave penalty
- Nonconcave penalized likelihood with a diverging number of parameters.
- One-step sparse estimates in nonconcave penalized likelihood models
- Piecewise linear regularized solution paths
- Sparsity and Smoothness Via the Fused Lasso
- Statistics for high-dimensional data. Methods, theory and applications.
- The elements of statistical learning. Data mining, inference, and prediction
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Variable selection for support vector machines in moderately high dimensions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Structured sparse support vector machine with ordered features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5073382)
