Sciweavers

481 search results - page 13 / 97
» Learning relational probability trees
Sort
View
ICMLA
2007
13 years 9 months ago
Phase transition and heuristic search in relational learning
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...
Érick Alphonse, Aomar Osmani
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 7 months ago
A Minimum Relative Entropy Principle for Learning and Acting
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...
Pedro A. Ortega, Daniel A. Braun
ACL
2007
13 years 9 months ago
Detecting Semantic Relations between Named Entities in Text Using Contextual Features
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 ...
Toru Hirano, Yoshihiro Matsuo, Gen-ichiro Kikui
UAI
2001
13 years 9 months ago
Markov Chain Monte Carlo using Tree-Based Priors on Model Structure
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...
Nicos Angelopoulos, James Cussens
NECO
2002
117views more  NECO 2002»
13 years 7 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
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...
James M. Coughlan, Alan L. Yuille