We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
The LinGO Redwoods initiative is a seed activity in the design and development of a new type of treebank. While several medium- to large-scale treebanks exist for English (and for...
Stephan Oepen, Kristina Toutanova, Stuart M. Shieb...
We apply robust Bayesian decision theory to improve both generative and discriminative learners under bias in class proportions in labeled training data, when the true class propo...