An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests

DOI10.1002/int.10085zbMath1028.68038OpenAlexW2164551395MaRDI QIDQ4416288

José M. Puerta, Luis M. de Campos, Juan M. Fernández-Luna

Publication date: 31 July 2003

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.10085

zbMATH Keywords

directed acyclic graphsALARMINSURANCE

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (3)

Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation ⋮ Structural learning of Bayesian networks by bacterial foraging optimization ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms

Cites Work

• Unnamed Item
• 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
• Adaptive probabilistic networks with hidden variables
• A new approach for learning belief networks using independence criteria
• Learning Bayesian networks: The combination of knowledge and statistical data
• Independency relationships and learning algorithms for singly connected networks
• A hybrid methodology for learning belief networks: BENEDICT

This page was built for publication: An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests