Convex Bidirectional Large Margin Classifiers
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A decision-theoretic generalization of on-line learning and an application to boosting
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Bidirectional discrimination with application to data visualization
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Component selection and smoothing in multivariate nonparametric regression
- Distance-Weighted Discrimination
- Gradient-based algorithms with applications to signal-recovery problems
- Hard or soft classification? Large-margin unified machines
- Numerical methods for large eigenvalue problems
- On search directions for minimization algorithms
- Piecewise linear regularized solution paths
- Smoothing spline ANOVA models for large data sets with Bernoulli observations and the randomized GACV.
- Spectral regularization algorithms for learning large incomplete matrices
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Convex Bidirectional Large Margin Classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621634)
