Results 211 to 220 of about 1,405 (240)
Some of the next articles are maybe not open access.
Hierarchical kernels in deep kernel learning
J. Mach. Learn. Res., 2023Summary: Kernel methods are built upon the mathematical theory of reproducing kernels and reproducing kernel Hilbert spaces. They enjoy good interpretability thanks to the solid mathematical foundation. Recently, motivated by deep neural networks in deep learning, which construct learning functions by successive compositions of activation functions and
Wentao Huang, Houbao Lu, Haizhang Zhang
openaire +2 more sources
Semisupervised Kernel Matrix Learning by Kernel Propagation
IEEE Transactions on Neural Networks, 2010The 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
18th International Conference on Pattern Recognition (ICPR'06), 2006
In this work we introduce a new methodology to build a kernel matrix from a collection of kernels. The key idea is to build an unique kernel that eliminates spurious differences between kernels. We propose a method based on the Procrustes problems that uses the Alternating Projections method to minimize a certain error measure.
Isaac Martín de Diego, Alberto Muñoz
openaire +2 more sources
In this work we introduce a new methodology to build a kernel matrix from a collection of kernels. The key idea is to build an unique kernel that eliminates spurious differences between kernels. We propose a method based on the Procrustes problems that uses the Alternating Projections method to minimize a certain error measure.
Isaac Martín de Diego, Alberto Muñoz
openaire +2 more sources
Journal of Economic Theory, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2023
We present Kernel QuantTree (KQT), a nonparametric change detection algorithm that monitors multivariate data through a histogram. KQT constructs a nonlinear partition of the input space that matches pre-defined target probabilities and specifically promotes compact bins adhering to the data distribution, resulting in a powerful detection algorithm. We
Stucchi D. +3 more
openaire +2 more sources
We present Kernel QuantTree (KQT), a nonparametric change detection algorithm that monitors multivariate data through a histogram. KQT constructs a nonlinear partition of the input space that matches pre-defined target probabilities and specifically promotes compact bins adhering to the data distribution, resulting in a powerful detection algorithm. We
Stucchi D. +3 more
openaire +2 more sources
2007
As new graph structured data is constantly being generated, learning and data mining on graphs have become a challenge in application areas such as molecular biology, telecommunications, chemoinformatics, and social network analysis. The central algorithmic problem in these areas, measuring similarity of graphs, has therefore received extensive ...
openaire +2 more sources
As new graph structured data is constantly being generated, learning and data mining on graphs have become a challenge in application areas such as molecular biology, telecommunications, chemoinformatics, and social network analysis. The central algorithmic problem in these areas, measuring similarity of graphs, has therefore received extensive ...
openaire +2 more sources
Representative Sets and Irrelevant Vertices
Journal of the ACM, 2020Stefan Kratsch, Magnus Wahlström
exaly

