Sciweavers

990 search results - page 33 / 198
» Learning with non-positive kernels
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
A novel robust kernel for appearance-based learning
Robustness is one of the most critical issues in the appearance-based learning strategies. In this work, we propose a novel kernel that is robust against data corruption for vario...
Chia-Te Liao, Shang-Hong Lai
ICASSP
2011
IEEE
13 years 1 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor
JMLR
2002
137views more  JMLR 2002»
13 years 9 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
COLING
2010
13 years 4 months ago
Kernel Slicing: Scalable Online Training with Conjunctive Features
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
Naoki Yoshinaga, Masaru Kitsuregawa
NIPS
2001
13 years 11 months ago
Learning a Gaussian Process Prior for Automatically Generating Music Playlists
This paper presents AutoDJ: a system for automatically generating music playlists based on one or more seed songs selected by a user. AutoDJ uses Gaussian Process Regression to le...
John C. Platt, Christopher J. C. Burges, S. Swenso...