An Efficient Bayesian Network Structure Learning Algorithm in the Presence of Deterministic Relations

Ahmed Mabrouk 1 Christophe Gonzales 1 Karine Jabet-Chevalier Eric Chojnaki
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Faithfulness is one of the main hypotheses on which rely most Bayesian network (BN) structure learning algorithms. When some random variables are deterministically determined by others, faithfulness is ruled out and classical learning algorithms fail to discover many dependences between variables, hence producing incorrect BNs. Even state-of-the-art algorithms dedicated to learning with deterministic variables prove to be inefficient to discover many dependences/independences. For critical applications, e.g., in nuclear safety, such failure is a serious issue. This paper introduces a new hybrid algorithm, combining a constraint-based approach with a greedy search, that includes specific rules dedicated to deterministic nodes that significantly reduce the incorrect learning. Experiments show that our method significantly outperforms state-of-the-art algorithms.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01215671
Contributor : Lip6 Publications <>
Submitted on : Wednesday, October 14, 2015 - 4:33:12 PM
Last modification on : Thursday, March 21, 2019 - 12:59:01 PM

Identifiers

Citation

Ahmed Mabrouk, Christophe Gonzales, Karine Jabet-Chevalier, Eric Chojnaki. An Efficient Bayesian Network Structure Learning Algorithm in the Presence of Deterministic Relations. European Conference on Artificial Intelligence - ECAI 2014, Aug 2014, Prague, Czech Republic. 263, pp.567-572, Frontiers in Artificial Intelligence and Applications. 〈10.3233/978-1-61499-419-0-567〉. 〈hal-01215671〉

Share

Metrics

Record views

82