Results 301 to 310 of about 1,278,153 (338)

Kernel Factory: An ensemble of kernel machines [PDF]

open access: possibleExpert Systems with Applications, 2013
We propose an ensemble method for kernel machines. The training data is randomly split into a number of mutually exclusive partitions defined by a row and column parameter. Each partition forms an input space and is transformed by an automatically selected kernel function into a kernel matrix K.
M. BALLINGS, D. VAN DEN POEL
openaire   +2 more sources

The bound of the kernel

Mathematical Social Sciences, 1992
We provide a better lower bound \(\varepsilon_{**}\) such that the kernel is a subset of the strong \(\varepsilon\)-core if \(\varepsilon\geq\varepsilon_{**}\).
Ching Yu Kan, Chih Chang
openaire   +2 more sources

Partitionable Kernels for Mapping Kernels

2011 IEEE 11th International Conference on Data Mining, 2011
Many of tree kernels in the literature are designed tanking advantage of the mapping kernel framework. The most important advantage of using this framework is that we have a strong theorem to examine positive definiteness of the resulting tree kernels.
openaire   +2 more sources

The Analyticity of Kernels

Canadian Journal of Mathematics, 1961
Let V be a paracompact real analytic manifold of dimension n ≥ 1. Following the terminology of the theory of distributions of Schwartz (4), is the linear space of infinitely differentiable functions with compact support in V with the appropriate inductive limit topology, is the Frechet space of infinitely differentiable functions on V, is the dual ...
J. De Barros-Neto, F. E. Browder
openaire   +2 more sources

On Kernel Inclusions

Reliable Computing, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Reinterpreting the Kernel

Journal of Economic Theory, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Kernel contraction

Journal of Symbolic Logic, 1994
AbstractKernel contraction is a natural nonrelational generalization of safe contraction. All partial meet contractions are kernel contractions, but the converse relationship does not hold. Kernel contraction is axiomatically characterized. It is shown to be better suited than partial meet contraction for formal treatments of iterated belief change.
openaire   +3 more sources

Kernel-Based Methods Kernel@Kernel-based method [PDF]

open access: possible, 2010
Inspired by the success of support vector machines, to improve generalization and classification abilities, conventional pattern classification techniques have been extended to incorporate maximizing margins and mapping to a feature space. For example, perceptron algorithms [1–4], neural networks (Chapter 9), and fuzzy systems (Chapter 10) have ...
openaire   +1 more source

Home - About - Disclaimer - Privacy