Počet záznamů: 1

An experimental comparison of triangulation heuristics on transformed BN2O networks

  1. 1.
    0330016 - UTIA-B 2010 RIV CZ eng C - Konferenční příspěvek (zahraniční konf.)
    Vomlel, Jiří - Savický, Petr
    An experimental comparison of triangulation heuristics on transformed BN2O networks.
    [Experimentální srovnání triangulačních heuristik na transformovaných sítích BN2O.]
    Proceedings of the 8th Workshop on Uncertainty Processing. Praha: University of Economics, 2009 - (Kroupa, T.; Vejnarová, J.), s. 251-260. ISBN 978-80-245-1543-4.
    [WUPES 2009. Liblice (CZ), 19.09.2009-23.09.2009]
    Grant CEP: GA MŠk 1M0572; GA MŠk(CZ) 1M0545; GA AV ČR 1ET100300517; GA ČR GA201/09/1891; GA ČR GEICC/08/E010
    Grant ostatní:GA MŠk(CZ) 2C06019
    Výzkumný záměr: CEZ:AV0Z10750506; CEZ:AV0Z10300504
    Klíčová slova: Bayesian networks * bipartite graphs * graph triangulation
    Kód oboru RIV: IN - Informatika
    http://library.utia.cas.cz/separaty/2009/MTR/vomlel-an experimental comparison of triangulation heuristics on transformed bn2o networks.pdf http://library.utia.cas.cz/separaty/2009/MTR/vomlel-an experimental comparison of triangulation heuristics on transformed bn2o networks.pdf

    In this paper we present results of experimental comparisons of several triangulation heuristics on bipartite graphs. Our motivation for testing heuristics on the family of bipartite graphs is the rank-one decomposition of BN2O networks. A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from the top level toward the bottom level and where all conditional probability tables are noisy-or gates. After applying the rank-one decomposition, which adds an extra level of auxiliary nodes in between the top and bottom levels, and after removing simplicial nodes of the bottom level we get so called BROD graph. This is an undirected bipartite graph. It is desirable for efficiency of the inference to find a triangulation of the BROD graph having the sum of table sizes for all cliques of the triangulated graph as small as possible. From this point of view, the minfill heuristics perform in average better than other tested heuristics (minwidth, h1, and mcs).

    V článku jsou prezentovány výsledky provnání různých heuristik pro triangulaci bipartitních grafů. Motivací pro testování heuristik na rodině bipartitních grafů je rozklad na tensory ranku jedna použitý na sítě typu BN2O.
    Trvalý link: http://hdl.handle.net/11104/0175891