Sciweavers

1822 search results - page 213 / 365
» Risk-Sensitive Online Learning
Sort
View
ICML
2007
IEEE
14 years 8 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
14 years 8 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
2004
IEEE
14 years 8 months ago
Unifying collaborative and content-based filtering
Collaborative and content-based filtering are two paradigms that have been applied in the context of recommender systems and user preference prediction. This paper proposes a nove...
Justin Basilico, Thomas Hofmann
ICML
2001
IEEE
14 years 8 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»
14 years 2 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