Sciweavers

255 search results - page 14 / 51
» On Online Learning of Decision Lists
Sort
View
COLT
2008
Springer
15 years 8 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
ICML
2005
IEEE
16 years 7 months ago
A theoretical analysis of Model-Based Interval Estimation
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
Alexander L. Strehl, Michael L. Littman
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
16 years 3 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
ICPR
2008
IEEE
16 years 17 days ago
Human reappearance detection based on on-line learning
Many video surveillance applications require detecting human reappearances in a scene monitored by a camera or over a network of cameras. This is the human reappearance detection ...
Lei Hu, Yizhou Wang, Shuqiang Jiang, Qingming Huan...
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 6 months ago
Real-time ranking with concept drift using expert advice
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...
Hila Becker, Marta Arias