Sciweavers

399 search results - page 54 / 80
» Robust Boosting for Learning from Few Examples
Sort
View
ATAL
2005
Springer
15 years 3 months ago
Rapid on-line temporal sequence prediction by an adaptive agent
Robust sequence prediction is an essential component of an intelligent agent acting in a dynamic world. We consider the case of near-future event prediction by an online learning ...
Steven Jensen, Daniel Boley, Maria L. Gini, Paul R...
WWW
2011
ACM
14 years 4 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
CVPR
2012
IEEE
13 years 6 days ago
Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
Jun He, Laura Balzano, Arthur Szlam
ICDE
2008
IEEE
189views Database» more  ICDE 2008»
15 years 4 months ago
Adapting ranking functions to user preference
— Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, whic...
Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, ...
EOR
2007
165views more  EOR 2007»
14 years 9 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang