A hybrid methodology for learning belief networks: BENEDICT

DOI10.1016/S0888-613X(01)00041-XzbMath0983.68197MaRDI QIDQ5944535

Silvia Acid, Luis M. de Campos

Publication date: 10 October 2001

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

belief networks structures

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T37: Reasoning under uncertainty in the context of artificial intelligence

68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence

Related Items

An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests, AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms, Inferring gene regulatory networks by an order independent algorithm using incomplete data sets, BENEDICT, Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood, The max-min hill-climbing Bayesian network structure learning algorithm, Ant colony optimization for learning Bayesian networks., Learning Bayesian networks from data: An information-theory based approach, Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs, BNC-PSO: structure learning of Bayesian networks by particle swarm optimization, A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic and quantitative approaches to reasoning and uncertainty. European conference ECSQARU '93, Granada, Spain, November 8-10, 1993. Proceedings
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Construction of Bayesian network structures from data: A brief survey and an efficient algorithm
• A new approach for learning belief networks using independence criteria
• Learning Bayesian networks: The combination of knowledge and statistical data
• Graphical and Recursive Models for Contingency Tables
• Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
• Independency relationships and learning algorithms for singly connected networks
• Approximating discrete probability distributions with dependence trees
• On Information and Sufficiency