701 search results - page 99 / 141 » Self Bounding Learning Algorithms |
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
NIPS
2001
13 years 9 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
ECML
1998
Springer
13 years 12 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...