Sciweavers

224 search results - page 29 / 45
» Bounding Learning Time in XCS
Sort
View
ICML
2004
IEEE
14 years 9 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
ICCV
2009
IEEE
15 years 1 months ago
Weakly supervised discriminative localization and classification: a joint learning process
Visual categorization problems, such as object classification or action recognition, are increasingly often approached using a detection strategy: a classifier function is first ...
Minh Hoai Nguyen, Lorenzo Torresani, Fernando de l...
LAMAS
2005
Springer
14 years 1 months ago
Unifying Convergence and No-Regret in Multiagent Learning
We present a new multiagent learning algorithm, RVσ(t), that builds on an earlier version, ReDVaLeR . ReDVaLeR could guarantee (a) convergence to best response against stationary ...
Bikramjit Banerjee, Jing Peng
NN
1997
Springer
174views Neural Networks» more  NN 1997»
14 years 18 days ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang