Sciweavers

558 search results - page 28 / 112
» Structural Modelling with Sparse Kernels
Sort
View
CIDM
2007
IEEE
15 years 1 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
IJCNN
2007
IEEE
15 years 4 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
NIPS
2001
14 years 11 months ago
Convolution Kernels for Natural Language
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
Michael Collins, Nigel Duffy
CORR
2010
Springer
207views Education» more  CORR 2010»
14 years 10 months ago
Collaborative Hierarchical Sparse Modeling
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
Pablo Sprechmann, Ignacio Ramírez, Guillerm...
JMLR
2012
13 years 10 days ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski