Triangulation Heuristics for BN2O Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F09%3A00327312" target="_blank" >RIV/67985807:_____/09:00327312 - isvavai.cz</a>
Alternative codes found
RIV/67985556:_____/09:00327312 RIV/61384399:31160/09:00033852
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Triangulation Heuristics for BN2O Networks
Original language description
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where all conditional probability tables are noisy-or gates. In order to performefficient inference, graphical transformations of these networks are performed. The complexity of inference is proportional to the total table size of tables corresponding to the cliques of the triangulated graph. Therefore in order to get efficient inference it is desirable to have small cliques in the triangulated graph. We analyze existing heuristic triangulation methods applicable to BN2O networks after transformations using parent divorcing and tensor rank-one decomposition and suggest several modifications. Both theoretical and experimental results confirm that tensor rank-one decomposition yields better results than parent divorcing in randomly generated BN2O networks that we tested.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Symbolic and Quantitative Approaches to Reasoning with Uncertainty
ISBN
978-3-642-02905-9
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Verona
Event date
Jul 1, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000268585700049