Sciweavers

2802 search results - page 353 / 561
» Online Learning with Kernels
Sort
View
ICML
2009
IEEE
15 years 11 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
89
Voted
ICML
2007
IEEE
15 years 11 months ago
Winnowing subspaces
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
Manfred K. Warmuth
ICML
2008
IEEE
15 years 11 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ICML
2001
IEEE
15 years 11 months ago
Expectation Maximization for Weakly Labeled Data
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
Yuri A. Ivanov, Bruce Blumberg, Alex Pentland
ADC
2006
Springer
156views Database» more  ADC 2006»
15 years 4 months ago
A new approach to intelligent text filtering based on novelty detection
This paper presents an original approach to modelling user’s information need in text filtering environment. This approach relies on a specific novelty detection model which a...
Randa Kassab, Jean-Charles Lamirel