Sciweavers

37 search results - page 2 / 8
» Positive Definite Rational Kernels
Sort
View
NIPS
2004
13 years 6 months ago
Semigroup Kernels on Finite Sets
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...
Marco Cuturi, Jean-Philippe Vert
ICML
2002
IEEE
14 years 6 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 2 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
13 years 9 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
ICPR
2008
IEEE
14 years 6 months ago
Indefinite Kernel Fisher Discriminant
Indefinite kernels arise in practice, e.g. from problem-specific kernel construction. Therefore, it is necessary to understand the behavior and suitability of classifiers in the c...
Bernard Haasdonk, Elzbieta Pekalska