2190 search results - page 274 / 438 » Learning with the Set Covering Machine |
108
Voted
COLT
2005
Springer
15 years 6 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
113
click to vote
IWCLS
1999
Springer
15 years 5 months ago
1999
Springer
In this paper we describe a simple model of adaptive agents of different types, represented by Learning Classifier Systems (LCS), which make investment decisions about a risk fre...
ICML
1994
IEEE
15 years 4 months ago
1994
IEEE
Many real-world domains bless us with a wealth of attributes to use for learning. This blessing is often a curse: most inductive methods generalize worse given too many attributes...
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...
113
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...