Classification with polynomial kernels and \(l^1\)-coefficient regularization
type: Item
instance of: scholarly article
title: Classification with polynomial kernels and \(l^1\)-coefficient regularization
zbMATH Open document ID: 1359.62265
author: Hongzhi Tong
author: Di-Rong Chen
author: Fenghong Yang
published in: Taiwanese Journal of Mathematics
publication date: 2017-03-09T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62J02
zbMATH DE Number: 6693475
zbMATH Keywords: classification
zbMATH Keywords: coefficient regularization
zbMATH Keywords: polynomial kernels
zbMATH Keywords: Bernstein-Kantorovich polynomial
zbMATH Keywords: learning rates
MaRDI profile type: Publication
full work available at URL: tjm.18.2014.3929
OpenAlex ID: W1984344762
cites work: The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Q3093220
cites work: On the mathematical foundations of learning
cites work: Support vector machines regression with \(l^1\)-regularizer
cites work: Q4261789
cites work: Local polynomial reproduction and moving least squares approximation
cites work: Multi-kernel regularized classifiers
cites work: SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
cites work: Learning with sample dependent hypothesis spaces
cites work: Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
cites work: Statistical behavior and consistency of classification methods based on convex risk minimization.
cites work: Approximation with polynomial kernels and SVM classifiers
DOI: 10.11650/TJM.18.2014.3929
description: scientific article; zbMATH DE number 6693475