About: Characterization of essential graphs by means of the operation of legal merging of components

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

About: Characterization of essential graphs by means of the operation of legal merging of components 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	One of the most common ways of representing classes of equivalence of Bayesian networks is the use of essential graphs.In the paper their characterization is presented. The main observation is that every essential graph is the largest chain graph within a special class of chain graphs without flags. A special operation of legal merging of components for these graphs is introduced. It leads to an algorithm for finding the essential graph on basic of any equivalent chain graph without flags. One of the most common ways of representing classes of equivalence of Bayesian networks is the use of essential graphs.In the paper their characterization is presented. The main observation is that every essential graph is the largest chain graph within a special class of chain graphs without flags. A special operation of legal merging of components for these graphs is introduced. It leads to an algorithm for finding the essential graph on basic of any equivalent chain graph without flags. (en) Jedním z nejběžnějších způsobů reprezentace tříd ekvivalence Bayesovských sítí jsou esenciální grafy. Článek prezetuje jejich charakterizaci. Hlavní pozorování je že každý esenciální graf je největší graf ve speciální třídě grafů bez tzv. flagů. Je zavedena speciální operace legálního sloučení komponent pro tyto grafy. To vede k algoritmu k nalezení esenciálniho grafu na základě libovolného ekvivalentního řetězcového grafu bez flagů (cs)
Title	Characterization of essential graphs by means of the operation of legal merging of components Charakterizace esencialnich grafů pomocí operace legalního sloučení komponent (cs) Characterization of essential graphs by means of the operation of legal merging of components (en)
skos:prefLabel	Characterization of essential graphs by means of the operation of legal merging of components Charakterizace esencialnich grafů pomocí operace legalního sloučení komponent (cs) Characterization of essential graphs by means of the operation of legal merging of components (en)
skos:notation	RIV/67985556:_____/04:00106244!RIV/2005/GA0/A16005/N
http://linked.open.../vavai/riv/strany	43;62
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/01/1482), P(IAA1075104), Z(AV0Z1075907)
http://linked.open...iv/cisloPeriodika	Suppl 5
http://linked.open...vai/riv/dodaniDat	2005
http://linked.open...aciTvurceVysledku	Studený, Milan
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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 teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	557398
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/04:00106244
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	chain graph;acyclic directed graph;essential graph (en)
http://linked.open.../riv/klicoveSlovo	essential graph chain graph acyclic directed graph
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[BA1B7DB8FDCC]
http://linked.open...i/riv/nazevZdroje	International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Conditional independence structures: information-theoretical approach II Highly structured distributions in artificial intelligence, cryptography and combinatorics
http://linked.open...UplatneniVysledku	2004
http://linked.open...v/svazekPeriodika	12
http://linked.open...iv/tvurceVysledku	Studený, Milan
http://linked.open...n/vavai/riv/zamer	Uncertainty methods in theoretical cybernetics: system identification, information processing, decision-making, and control
issn	0218-4885
number of pages	20 (xsd:int)

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