Incremental Junction Tree Inference - Sorbonne Université Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Incremental Junction Tree Inference

Hamza Agli
Christophe Gonzales
Pierre-Henri Wuillemin

Résumé

Performing probabilistic inference in multi-target dynamic systems is a challenging task. When the system, its evidence and/or its targets evolve, most of the inference algorithms either recompute everything from scratch, even though incremental changes do not invalidate all the previous computations, or do not fully exploit incrementality to minimize computations. This incurs strong unnecessary overheads when the system under study is large. To alleviate this problem, we propose in this paper a new junction tree-based message-passing inference algorithm that, given a new query, minimizes computations by identifying precisely the set of messages that differ from the preceding computations. Experimental results highlight the efficiency of our approach.
Fichier principal
Vignette du fichier
article.pdf (453.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01345418 , version 1 (13-07-2016)

Identifiants

Citer

Hamza Agli, Philippe Bonnard, Christophe Gonzales, Pierre-Henri Wuillemin. Incremental Junction Tree Inference. IPMU16, Jun 2016, Eindhoven, Netherlands. ⟨10.1007/978-3-319-40596-4_28⟩. ⟨hal-01345418⟩
386 Consultations
243 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More