An efficient kernel learning algorithm for semisupervised regression problems
From MaRDI portal
Publication:1665702
DOI10.1155/2015/451947zbMATH Open1395.62107OpenAlexW1621482170WikidataQ59118611 ScholiaQ59118611MaRDI QIDQ1665702FDOQ1665702
Authors: Chao Zhang, Shao-Gao Lv 
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/451947
Recommendations
- Learning the kernel matrix with semidefinite programming
- scientific article; zbMATH DE number 5997280
- Efficient and adaptive linear regression in semi-supervised settings
- Semi-supervised learning with regularized Laplacian
- On the choice of kernel and labelled data in semi-supervised learning methods
- Learning Bounds for Kernel Regression Using Effective Data Dimensionality
- Learning the kernel function via regularization
Cites Work
- Large scale multiple kernel learning
- Theory of Reproducing Kernels
- Learning Theory
- On the mathematical foundations of learning
- Title not available (Why is that?)
- Learning the kernel matrix with semidefinite programming
- Title not available (Why is that?)
- Learning rates of least-square regularized regression
- Multi-kernel regularized classifiers
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Optimal learning rates of \(l^p\)-type multiple kernel learning under general conditions
- On the convergence rate of \(l_{p}\)-norm multiple kernel learning
- Regularized least square regression with dependent samples
- Statistical learning theory: models, concepts, and results
- Error bounds for \(l^p\)-norm multiple kernel learning with least square loss
Cited In (6)
- Ideal regularization for learning kernels from labels
- Generalization analysis of Fredholm kernel regularized classifiers
- Kernel based algorithms for mining huge data sets. Supervised, semi-supervised, and unsupervised learning.
- Efficient learning of supervised kernels with a graph-based loss function
- Efficient and adaptive linear regression in semi-supervised settings
- Kernel-based transition probability toward similarity measure for semi-supervised learning
Uses Software
This page was built for publication: An efficient kernel learning algorithm for semisupervised regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665702)
