About: An experimental comparison of triangulation heuristics on transformed BN2O networks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: An experimental comparison of triangulation heuristics on transformed BN2O networks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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). 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). (en)
Title	An experimental comparison of triangulation heuristics on transformed BN2O networks An experimental comparison of triangulation heuristics on transformed BN2O networks (en)
skos:prefLabel	An experimental comparison of triangulation heuristics on transformed BN2O networks An experimental comparison of triangulation heuristics on transformed BN2O networks (en)
skos:notation	RIV/67985807:_____/09:00330016!RIV10-MSM-67985807
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET100300517), P(1M0545), P(1M0572), P(2C06019), P(GA201/09/1891), P(GEICC/08/E010), Z(AV0Z10300504), Z(AV0Z10750506)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Savický, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav informatiky AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	302728
http://linked.open...ai/riv/idVysledku	RIV/67985807:_____/09:00330016
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Bayesian networks; bipartite graphs; graph triangulation (en)
http://linked.open.../riv/klicoveSlovo	bipartite graphs Bayesian networks graph triangulation
http://linked.open...ontrolniKodProRIV	[5807E4673A34]
http://linked.open...v/mistoKonaniAkce	Liblice
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...i/riv/nazevZdroje	Proceedings of the 8th Workshop on Uncertainty Processing
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing Institute for Theoretical Computer Science Data, algorithms, decision making (Medical) Knowledge Acquisition and Modelling Multidimensional Models of Uncertainty The logic of causal and probabilistic reasoning in uncertain environments
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Vomlel, Jiří Savický, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-09-19 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Informatika pro informační společnost: modely, algoritmy, aplikace Pokročilé matematické metody získávání, zpracování a využití informací a znalostí ve složitých a nedeterministických systémech
number of pages	10 (xsd:int)
http://purl.org/ne...btex#hasPublisher	University of Economics
https://schema.org/isbn	978-80-245-1543-4
is http://linked.open...avai/riv/vysledek of	An experimental comparison of triangulation heuristics on transformed BN2O networks An experimental comparison of triangulation heuristics on transformed BN2O networks An experimental comparison of triangulation heuristics on transformed BN2O networks An experimental comparison of triangulation heuristics on transformed BN2O networks

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software