bibtype	C - Conference Paper (international conference)
ARLID	0330016
utime	20240111140726.3
mtime	20091005235959.9
title (primary) (eng)	An experimental comparison of triangulation heuristics on transformed BN2O networks
specification	page_count 10 s. media_type www
serial	ARLID cav_un_epca*0333753 ISBN 978-80-245-1543-4 title Proceedings of the 8th Workshop on Uncertainty Processing page_num 251-260 publisher place Praha name University of Economics year 2009 editor name1 Kroupa name2 Tomáš editor name1 Vejnarová name2 Jiřina
title (cze)	Experimentální srovnání triangulačních heuristik na transformovaných sítích BN2O
keyword	Bayesian networks
keyword	bipartite graphs
keyword	graph triangulation
author (primary)	ARLID cav_un_auth*0101228 name1 Vomlel name2 Jiří institution UTIA-B full_dept Department of Decision Making Theory fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author	ARLID cav_un_auth*0100825 name1 Savický name2 Petr institution UIVT-O full_dept Department of Theoretical Computer Science fullinstit Ústav informatiky AV ČR, v. v. i.
source	source_type pdf url http://library.utia.cas.cz/separaty/2009/MTR/vomlel-an experimental comparison of triangulation heuristics on transformed bn2o networks.pdf
cas_special	project project_id 1M0572 agency GA MŠk ARLID cav_un_auth*0001814 project project_id 1M0545 agency GA MŠk country CZ ARLID cav_un_auth*0203502 project project_id 1ET100300517 agency GA AV ČR ARLID cav_un_auth*0001446 project project_id GA201/09/1891 agency GA ČR ARLID cav_un_auth*0253175 project project_id GEICC/08/E010 agency GA ČR ARLID cav_un_auth*0241637 project project_id 2C06019 agency GA MŠk country CZ ARLID cav_un_auth*0216518 research CEZ:AV0Z10750506 research CEZ:AV0Z10300504 abstract (eng) 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). abstract (cze) 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. action ARLID cav_un_auth*0254543 name WUPES 2009 place Liblice dates 19.09.2009-23.09.2009 country CZ reportyear 2010 RIV IN permalink http://hdl.handle.net/11104/0175891 arlyear 2009 mrcbU56 pdf mrcbU63 cav_un_epca*0333753 Proceedings of the 8th Workshop on Uncertainty Processing 978-80-245-1543-4 251 260 Praha University of Economics 2009 mrcbU67 Kroupa Tomáš 340 mrcbU67 Vejnarová Jiřina 340