Incremental Junction Tree Inference - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Incremental Junction Tree Inference

Hamza Agli
Christophe Gonzales
Pierre-Henri Wuillemin


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
Origin : Files produced by the author(s)

Dates and versions

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



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⟩
385 View
241 Download



Gmail Facebook X LinkedIn More