Results 261 to 270 of about 7,097,220 (297)
Some of the next articles are maybe not open access.

Frame Kernels for Learning

2002
This paper deals with a way of constructing reproducing kernel Hilbert spaces and their associated kernels from frame theory. After introducing briefly frame theory, we give mild conditions on frame elements for spanning a RKHS. Examples of different kernels are then given based on wavelet frame.
Alain Rakotomamonjy, Stéphane Canu
openaire   +2 more sources

Semisupervised Kernel Matrix Learning by Kernel Propagation

IEEE Transactions on Neural Networks, 2010
The goal of semisupervised kernel matrix learning (SS-KML) is to learn a kernel matrix on all the given samples on which just a little supervised information, such as class label or pairwise constraint, is provided. Despite extensive research, the performance of SS-KML still leaves some space for improvement in terms of effectiveness and efficiency ...
Enliang Hu   +3 more
openaire   +2 more sources

Kernel Methods in Machine Learning

open access: yesAnnals of Statistics, 2008
We review machine learning methods employing positive definite kernels. These methods formulate learning and estimation problems in a reproducing kernel Hilbert space (RKHS) of functions defined on the data domain, expanded in terms of a kernel. Working in linear spaces of function has the benefit of facilitating the construction and analysis of ...
Bernhard Schölkopf, Alexander J Smola
exaly   +6 more sources

Multiple Kernel Learning with High Order Kernels

2010 20th International Conference on Pattern Recognition, 2010
Previous Multiple Kernel Learning approaches (MKL) employ different kernels by their linear combination. Though some improvements have been achieved over methods using single kernel, the advantages of employing multiple kernels for machine learning are far from being fully developed.
Shuhui Wang   +3 more
openaire   +2 more sources

Kernel online learning with adaptive kernel width

Neurocomputing, 2016
This paper discusses a unified framework for kernel online learning (KOL) algorithm with adaptive kernels. Unlike the traditional KOL algorithms which applied a fixed kernel width in the training process, the kernel width is considered as an additional free parameter and can be adapted automatically.
Haijin Fan   +2 more
openaire   +2 more sources

Multiple kernel learning by empirical target kernel

International Journal of Wavelets, Multiresolution and Information Processing, 2019
Multiple kernel learning (MKL) aims at learning an optimal combination of base kernels with which an appropriate hypothesis is determined on the training data. MKL has its flexibility featured by automated kernel learning, and also reflects the fact that typical learning problems often involve multiple and heterogeneous data sources.
Peiyan Wang, Dongfeng Cai
openaire   +2 more sources

Continuous Kernel Learning

2016
Kernel learning is the problem of determining the best kernel (either from a dictionary of fixed kernels, or from a smooth space of kernel representations) for a given task. In this paper, we describe a new approach to kernel learning that establishes connections between the Fourier-analytic representation of kernels arising out of Bochner’s theorem ...
John Moeller   +4 more
openaire   +1 more source

Learning Kernel Classifiers

Journal of the American Statistical Association, 2003
(2003). Learning Kernel Classifiers. Journal of the American Statistical Association: Vol. 98, No. 462, pp. 489-490.
openaire   +2 more sources

Learning with non-positive kernels

Twenty-first international conference on Machine learning - ICML '04, 2004
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer's condition and they induce associated functional spaces called Reproducing Kernel Kreĭn Spaces (RKKS), a generalization of Reproducing Kernel Hilbert Spaces (RKHS).Machine ...
Ong, C., Mary , X., Cnu, S., Smola, A.
openaire   +3 more sources

Multiple Graph-Kernel Learning

2015 IEEE Symposium Series on Computational Intelligence, 2015
Kernels for structures, including graphs, generally suffer of the diagonally dominant gram matrix issue, the effect by which the number of sub-structures, or features, shared between instances are very few with respect to those shared by an instance with itself.
AIOLLI, FABIO   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy