Junction trees constructions in Bayesian networks
Document Type
Conference Proceeding
Source of Publication
Journal of Physics: Conference Series
Publication Date
10-28-2017
Abstract
© Published under licence by IOP Publishing Ltd. Junction trees are used as graphical structures over which propagation will be carried out through a very important property called the ruining intersection property. This paper examines an alternative method for constructing junction trees that are essential for the efficient computations of probabilities in Bayesian networks. The new proposed method converts a sequence of subsets of a Bayesian network into a junction tree, in other words, into a set of cliques that has the running intersection property. The obtained set of cliques and separators coincide with the junction trees obtained by the moralization and triangulation process, but it has the advantage of adapting to any computational task by adding links to the Bayesian network graph.
DOI Link
ISSN
Publisher
Institute of Physics Publishing
Volume
893
Issue
1
Disciplines
Mathematics
Keywords
Forestry, Trees (mathematics), Computational task, Efficient computation, Graphical structures, Junction trees, Bayesian networks
Scopus ID
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Recommended Citation
Smail, Linda, "Junction trees constructions in Bayesian networks" (2017). All Works. 2193.
https://zuscholars.zu.ac.ae/works/2193
Indexed in Scopus
yes
Open Access
yes
Open Access Type
Gold: This publication is openly available in an open access journal/series