2223 search results - page 105 / 445 » Implicit Online Learning |
136
Voted
COLT
1999
Springer
15 years 9 months ago
1999
Springer
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 ...
145
click to vote
KES
2005
Springer
15 years 10 months ago
2005
Springer
Pervasive computing environment and users’ demand for multimedia personalization precipitate a need for personalization tools to help people access desired multimedia content at ...
141
Voted
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...
175
click to vote
ESANN
2004
15 years 6 months ago
2004
Ensemble algorithms can improve the performance of a given learning algorithm through the combination of multiple base classifiers into an ensemble. In this paper, the idea of usin...
148
click to vote
EPIA
2009
Springer
15 years 11 months ago
2009
Springer
This paper presents an approach for categorizing documents according to their implicit locational relevance. We report a thorough evaluation of several classifiers designed for th...