A conditional independence algorithm for learning undirected graphical models

DOI10.1016/j.jcss.2009.05.003zbMath1186.68356MaRDI QIDQ1049272

Christian Borgelt

Publication date: 8 January 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.05.003

zbMATH Keywords

graphical models; conditional independence test; possibilistic network; learning from data

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68T05: Learning and adaptive systems in artificial intelligence

68R10: Graph theory (including graph drawing) in computer science

Related Items

Discovering gene association networks by multi-objective evolutionary quantitative association rules, A decomposition algorithm for learning Bayesian networks based on scoring function, An overview of recent advancements in causal studies, Algorithms for convex hull finding in undirected graphical models

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The max-min hill-climbing Bayesian network structure learning algorithm
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Bayesian network modeling of strokes and their relationships for on-line handwriting recognition.
• Learning Bayesian networks from data: An information-theory based approach
• On discriminative Bayesian network classifiers and logistic regression
• Advances in Bayesian networks. Some papers have been presented at the first European workshop on probabilistic graphical models (PGM'02), Cuenca, Spain, November 6--8, 2002.
• Learning Bayesian networks: The combination of knowledge and statistical data
• 10.1162/153244303321897717
• Approximating discrete probability distributions with dependence trees