Sciweavers

1419 search results - page 131 / 284
» Approximation Methods for Supervised Learning
Sort
View
118
Voted
ECCV
2008
Springer
16 years 2 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
MIR
2003
ACM
178views Multimedia» more  MIR 2003»
15 years 5 months ago
A bootstrapping approach to annotating large image collection
Huge amount of manual efforts are required to annotate large image/video archives with text annotations. Several recent works attempted to automate this task by employing supervis...
HuaMin Feng, Tat-Seng Chua
ICMLA
2008
15 years 2 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux
ICML
2008
IEEE
16 years 1 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
ML
2002
ACM
220views Machine Learning» more  ML 2002»
15 years 7 days ago
Bayesian Methods for Support Vector Machines: Evidence and Predictive Class Probabilities
I describe a framework for interpreting Support Vector Machines (SVMs) as maximum a posteriori (MAP) solutions to inference problems with Gaussian Process priors. This probabilisti...
Peter Sollich