Sciweavers

133 search results - page 20 / 27
» Online Learning of Non-stationary Sequences
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
MLDM
2009
Springer
14 years 1 months ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
ATAL
2005
Springer
14 years 27 days ago
The induction of communication protocols
This paper describes our preliminary analysis on the induction of communication protocols. Our work has two goals: (i) to recognize rules (i.e. protocols) from the communicative b...
Nik Nailah Binti Abdullah
COLT
2001
Springer
13 years 12 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
ICML
2010
IEEE
13 years 8 months ago
Detecting Large-Scale System Problems by Mining Console Logs
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...