1235 search results - page 40 / 247 » Learning with Idealized Kernels |
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing thi...
ILP
2007
Springer
14 years 4 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods ...
IADIS
2008
13 years 11 months ago
2008
Building semantics concepts into the learning tools and utilities will open the road for the next generation of the Learning Content Management System (LCMS). We propose here to n...