2190 search results - page 285 / 438 » Learning with the Set Covering Machine |
129
Voted
ALT
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the problem of sequence prediction in a probabilistic setting. Let there be given a class C of stochastic processes (probability measures on the set of one-wa...
108
click to vote
ALT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
112
click to vote
AIA
2007
15 years 2 months ago
2007
A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
119
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
105
Voted
ICALT
2010
IEEE
15 years 28 days ago
2010
IEEE
—Adaptive educational hypermedia allows lessons to be personalized according to the needs of the learner. However, to achieve this, content must be split into stand-alone fragmen...