2780 search results - page 163 / 556 » Learning to Order Things |
123
click to vote
UAI
1998
15 years 5 months ago
1998
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
132
click to vote
NIPS
1994
15 years 5 months ago
1994
We present a statistical method that PAC learns the class of stochastic perceptrons with arbitrary monotonic activation function and weights wi {-1, 0, +1} when the probability d...
126
click to vote
IJCAI
1989
15 years 5 months ago
1989
Explanation-based generalization algorithms need to generalize the structure of their explanations. This is necessary in order to acquire concepts where a recursive or iterative p...
139
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
132
click to vote
JUCS
2008
15 years 4 months ago
2008
: This paper deals with a progressive learning method for symbol recognition which improves its own recognition rate when new symbols are recognized in graphic documents. We propos...