481 search results - page 13 / 97 » Learning relational probability trees |
70
Voted
ICMLA
2007
14 years 11 months ago
2007
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper proposes a method to construct an adaptive agent that is universal with respect to a given class of experts, where each expert is designed specifically for a particular...
ACL
2007
14 years 11 months ago
2007
This paper proposes a supervised learning method for detecting a semantic relation between a given pair of named entities, which may be located in different sentences. The method ...
108
Voted
UAI
2001
14 years 10 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
72
Voted
NECO
2002
14 years 9 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...