A simpler approach to coefficient regularized support vector machines regression
From MaRDI portal
Publication:1722337
DOI10.1155/2014/206015zbMath1470.62058OpenAlexW2140522575WikidataQ59036021 ScholiaQ59036021MaRDI QIDQ1722337
Hongzhi Tong, Di-Rong Chen, Fenghong Yang
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/206015
Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation analysis of learning algorithms for support vector regression and quantile regression
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Least square regression with indefinite kernels and coefficient regularization
- Estimating conditional quantiles with the help of the pinball loss
- Unified approach to coefficient-based regularized regression
- Multi-kernel regularized classifiers
- Analysis of support vector machines regression
- Support vector machines regression with \(l^1\)-regularizer
- An approximation theory approach to learning with \(\ell^1\) regularization
- Density problem and approximation error in learning theory
- Learning with sample dependent hypothesis spaces
- INDEFINITE KERNEL NETWORK WITH DEPENDENT SAMPLING
- Least Square Regression with lp-Coefficient Regularization
- Support Vector Machines
- Decoding by Linear Programming
- Capacity of reproducing kernel spaces in learning theory
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Theory of Reproducing Kernels
This page was built for publication: A simpler approach to coefficient regularized support vector machines regression