An Efficient Bayesian Network Structure Learning Algorithm in the Presence of Deterministic Relations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

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

Ahmed Mabrouk
  • Fonction : Auteur
  • PersonId : 971656
Christophe Gonzales
Karine Jabet-Chevalier
  • Fonction : Auteur
Eric Chojnaki
  • Fonction : Auteur

Résumé

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.
Fichier non déposé

Dates et versions

hal-01215671 , version 1 (14-10-2015)

Identifiants

Citer

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. pp.567-572, ⟨10.3233/978-1-61499-419-0-567⟩. ⟨hal-01215671⟩
139 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More