384 search results - page 6 / 77 » Learning Markov Network Structure with Decision Trees |
UAI
2001
13 years 9 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...
IJCAI
2007
13 years 9 months ago
2007
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
ILP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
TSP
2010
13 years 2 months ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...