Learning decomposable Markov networks in pseudo-independent domains with local evaluation

DOI10.1007/s10994-006-8366-8zbMath1470.68199OpenAlexW2000334459MaRDI QIDQ851873

N. E. Zubov

Publication date: 22 November 2006

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-006-8366-8

zbMATH Keywords

knowledge discoveryprobabilistic reasoninglocal computationdecomposable Markov networkslearning graphical models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Uses Software

• WEBWEAVR-III
• MIM

Cites Work

• A microscopic study of minimum entropy search in learning decomposable Markov networks
• Modeling by shortest data description
• A Bayesian method for the induction of probabilistic networks from data
• Hyper Markov laws in the statistical analysis of decomposable graphical models
• Maximum likelihood bounded tree-width Markov networks
• Learning Bayesian networks: The combination of knowledge and statistical data
• Decomposition of maximum likelihood in mixed graphical interaction models
• Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
• Probabilistic Reasoning in Multiagent Systems
• A Method for the Construction of Minimum-Redundancy Codes
• Approximating discrete probability distributions with dependence trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item