Stable structure learning with hc-stable and tabu-stable algorithms

DOI10.1016/J.IJAR.2025.109522MaRDI QIDQ6883172zbMATH OpenFDO

Authors Neville K. Kitson, Anthony C. Constantinou

Publication date 16 December 2025

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

Full work available at URL https://doi.org/10.1016/J.IJAR.2025.109522

zbMATH Keywords

algorithm stabilityBayesian networkstructure learning

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• 10.1162/153244303321897717
• A Bayesian method for the induction of probabilistic networks from data
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• Causality. Models, reasoning, and inference
• Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
• scientific article; zbMATH DE number 6378135 (Why is no real title available?)
• Integer linear programming for the Bayesian network structure learning problem
• Learning Bayesian networks: The combination of knowledge and statistical data
• Order-independent constraint-based causal structure learning
• Probabilistic graphical models.
• The max-min hill-climbing Bayesian network structure learning algorithm
• Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms

Cited in

(1)

• Special issue on the twelfth international conference on probabilistic graphical models (PGM 2024)

This page was built for publication: Stable structure learning with hc-stable and tabu-stable algorithms

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