2157 search results - page 304 / 432 » Learning Switching Concepts |
106
Voted
COLT
2001
Springer
15 years 5 months ago
2001
Springer
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 ...
122
Voted
SIBGRAPI
2000
IEEE
15 years 5 months ago
2000
IEEE
This work has as main objective to present an off-line signature verification system. It is basically divided into three parts. The first one demonstrates a pre-processing process,...
104
Voted
COLT
1997
Springer
15 years 4 months ago
1997
Springer
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
110
click to vote
COLT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
109
click to vote
COLT
2006
Springer
15 years 2 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...