Metaheuristics for Score-and-Search Bayesian Network Structure Learning

DOI10.1007/978-3-319-57351-9_17MaRDI QIDQ3305120zbMATH OpenOpenAlexFDO

Authors Colin Lee, P. van Beek

Publication date 5 August 2020

Published in Advances in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57351-9_17

zbMATH Keywords

Bayesian networklocal searchmemetic algorithmBayesian network structureiterate local search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Structure learning of Bayesian networks by continuous particle swarm optimization algorithms
• Bayesian network structure learning: hybridizing complete search with independence tests
• Optimal search on clustered structural constraint for learning Bayesian network structure

Cites work

• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• 10.1162/153244302760200696
• Ant colony optimization for learning Bayesian networks.
• Efficient structure learning of Bayesian networks using constraints
• Paramils: an automatic algorithm configuration framework
• Probabilistic graphical models.
• Stochastic local search. Foundations and applications.
• Structural learning of Bayesian networks using local algorithms based on the space of orderings
• The linear ordering problem: instances, search space analysis and algorithms

Cited in

(1)

• Learning tractable NAT-modeled Bayesian networks

Describes a project that uses

Uses Software

• Paramils

This page was built for publication: Metaheuristics for Score-and-Search Bayesian Network Structure Learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305120)