Pages that link to "Item:Q1872633"
From MaRDI portal
The following pages link to Support vector machines are universally consistent (Q1872633):
Displaying 39 items.
- A new learning paradigm: learning using privileged information (Q280342) (← links)
- Spatio-temporal convolution kernels (Q298357) (← links)
- Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
- On qualitative robustness of support vector machines (Q538179) (← links)
- Learning errors of linear programming support vector regression (Q552420) (← links)
- Robust support vector machines for multiple instance learning (Q744714) (← links)
- Relaxing support vectors for classification (Q744716) (← links)
- A consistency result for functional SVM by spline interpolation (Q857108) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- Kernel methods in machine learning (Q930651) (← links)
- Estimation of the misclassification error for multicategory support vector machine classification (Q943493) (← links)
- Learning from dependent observations (Q958916) (← links)
- Fast rates for support vector machines using Gaussian kernels (Q995417) (← links)
- Robust learning from bites for data mining (Q1020821) (← links)
- Distribution-free consistency of empirical risk minimization and support vector regression (Q1047919) (← links)
- Analysis of regularized least squares for functional linear regression model (Q1791683) (← links)
- Statistical behavior and consistency of classification methods based on convex risk minimization. (Q1884603) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- Non-asymptotic error bound for optimal prediction of function-on-function regression by RKHS approach (Q2131156) (← links)
- Robustness of learning algorithms using hinge loss with outlier indicators (Q2292231) (← links)
- Fully online classification by regularization (Q2381648) (← links)
- Statistical performance of support vector machines (Q2426613) (← links)
- The consistency of multicategory support vector machines (Q2491223) (← links)
- Approximation with polynomial kernels and SVM classifiers (Q2498387) (← links)
- Learning rates of gradient descent algorithm for classification (Q2519710) (← links)
- Averaging versus voting: a comparative study of strategies for distributed classification (Q2668577) (← links)
- Online regularized generalized gradient classification algorithms (Q3110496) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Consistency and convergence rate for nearest subspace classifier (Q4603717) (← links)
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming (Q4678449) (← links)
- Two‐sample test based on classification probability (Q4970306) (← links)
- Generalization and learning rate of multi-class support vector classification and regression (Q5097891) (← links)
- A Note on Support Vector Machines with Polynomial Kernels (Q5380381) (← links)
- (Q5381123) (← links)
- A tutorial on <i>ν</i>‐support vector machines (Q5467277) (← links)
- Online Classification with Varying Gaussians (Q5851123) (← links)
- Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context (Q5871032) (← links)
- Comment (Q5891754) (← links)
- Comment (Q5965645) (← links)