Treffer: Learning Causal Networks using Uncertain Experts' Knowledge A Hybrid Algorithm for Learning Causal Networks using Uncertain Experts' Knowledge

Title:
Learning Causal Networks using Uncertain Experts' Knowledge A Hybrid Algorithm for Learning Causal Networks using Uncertain Experts' Knowledge
Contributors:
COntraintes, ALgorithmes et Applications (COALA), Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), ENGIE, Antonio Salmerón, Rafael Rumı́
Source:
11th International Conference on Probabilistic Graphical Models (PGM 2022). :241-252
Publisher Information:
CCSD, 2022.
Publication Year:
2022
Collection:
collection:UNIV-TLN
collection:CNRS
collection:UNIV-AMU
collection:LIS-LAB
collection:INCIAM
Subject Geographic:
Original Identifier:
HAL: hal-04942404
Document Type:
Konferenz conferenceObject<br />Conference papers
Language:
English
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.hal.04942404v1
Database:
HAL

Weitere Informationen

Bayesian networks (BN) have become one of the most popular frameworks in causal studies. The causal relations between variables are encoded by the structure of the model, which is a directed acyclic graph (DAG). Unfortunately, despite the significant advances in algorithm development, learning the causal structure from data remains a very challenging task, especially for cases with a large number of variables. When the learning algorithm fails to identify the causal orientation of some edges, the human expert can provide some rough guidelines to complete the causal discovery. In many application domains, the expert knowledge might be uncertain about the right orientation of the edge. Worst, it may contradict the orientations learned from observational data, hence leading to conflicting situations. This paper presents a new hybrid algorithm combining a constraint-based approach with a greedy search, that includes specific rules to cope with uncertain domain/expert knowledge at different steps of the learning process. Experiments show the robustness of our method compared to other state-of-the-art algorithms.