Structured Set Variable Domains in Bayesian Network Structure Learning - ANITI - Artificial and Natural Intelligence Toulouse Institute
Communication Dans Un Congrès Année : 2022

Structured Set Variable Domains in Bayesian Network Structure Learning

Résumé

Constraint programming is a state of the art technique for learning the structure of Bayesian Networks from data (Bayesian Network Structure Learning-BNSL). However, scalability both for CP and other combinatorial optimization techniques for this problem is limited by the fact that the basic decision variables are set variables with domain sizes that may grow super polynomially with the number of random variables. Usual techniques for handling set variables in CP are not useful, as they lead to poor bounds. In this paper, we propose using decision trees as a data structure for storing sets of sets to represent set variable domains. We show that relatively simple operations are sufficient to implement all propagation and bounding algorithms, and that the use of these data structures improves scalability of a state of the art CP-based solver for BNSL.
Fichier principal
Vignette du fichier
main.pdf (487.11 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03674105 , version 1 (20-05-2022)

Identifiants

Citer

Fulya Trösser, Simon De Givry, George Katsirelos. Structured Set Variable Domains in Bayesian Network Structure Learning. The 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. ⟨10.4230/LIPIcs.CP.2022.40⟩. ⟨hal-03674105⟩
91 Consultations
62 Téléchargements

Altmetric

Partager

More