ALT
2008
Springer
14 years 9 months ago
2008
Springer
ALT
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
ALT
2008
Springer
14 years 9 months ago
2008
Springer
ALT
2008
Springer
14 years 9 months ago
2008
Springer
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the ...
ALT
2008
Springer
14 years 9 months ago
2008
Springer
The question investigated in this paper is to what extent an input representation influences the success of learning, in particular from the point of view of analyzing agents that...
ALT
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
ALT
2008
Springer
14 years 9 months ago
2008
Springer
ALT
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
ALT
2008
Springer
14 years 9 months ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
ALT
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...