Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning

DOI10.1155/2014/625173zbMath1407.68403OpenAlexW2113568591WikidataQ59066671 ScholiaQ59066671MaRDI QIDQ1718795

Tao Song, Guangyi Liu, Dalong Zhang, Ou Li

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/625173

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• TETRAD

Cites Work

• 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
• A characterization of Markov equivalence classes for acyclic digraphs
• Learning Bayesian networks: The combination of knowledge and statistical data
• Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective

This page was built for publication: Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning