Sciweavers

45 search results - page 3 / 9
» Online learning of conditionally I.I.D. data
Sort
View
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
14 years 8 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
14 years 5 months ago
Spatio-temporal patches for night background modeling by subspace learning
In this paper, a novel background model on spatio-temporal patches is introduced for video surveillance, especially for night outdoor scene, where extreme lighting conditions ofte...
Youdong Zhao, Haifeng Gong, Liang Lin, Yunde Jia
JFR
2006
140views more  JFR 2006»
13 years 10 months ago
Improving robot navigation through self-supervised online learning
In mobile robotics, there are often features that, while potentially powerful for improving navigation, prove difficult to profit from as they generalize poorly to novel situations...
Boris Sofman, Ellie Lin, J. Andrew Bagnell, John C...
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
14 years 5 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
COLT
1999
Springer
14 years 3 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma