384 search results - page 50 / 77 » Learning Markov Network Structure with Decision Trees |
AAAI
2011
12 years 8 months ago
2011
Important ecological phenomena are often observed indirectly. Consequently, probabilistic latent variable models provide an important tool, because they can include explicit model...
UAI
2001
13 years 10 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
UAI
2004
13 years 10 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...