About: Characterization of essential graphs by means of an operation of legal component merging.

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

About: Characterization of essential graphs by means of an operation of legal component merging. 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	The essential graph is known as a representative of an equivalence class of Bayesian networks. In the contribution an alternative characterization of essential graphs is presented. The characterization is based on a special operation with chain graphs without flags which is called the legal component merging. The operation leads to an algorithm for finding the essential graph on basis of any graph in the equivalence class of chain graphs without flags, in particular on basis of any Bayesian network. The essential graph is known as a representative of an equivalence class of Bayesian networks. In the contribution an alternative characterization of essential graphs is presented. The characterization is based on a special operation with chain graphs without flags which is called the legal component merging. The operation leads to an algorithm for finding the essential graph on basis of any graph in the equivalence class of chain graphs without flags, in particular on basis of any Bayesian network. (en)
Title	Characterization of essential graphs by means of an operation of legal component merging. Characterization of essential graphs by means of an operation of legal component merging. (en)
skos:prefLabel	Characterization of essential graphs by means of an operation of legal component merging. Characterization of essential graphs by means of an operation of legal component merging. (en)
skos:notation	RIV/67985556:_____/02:16020195!RIV/2003/GA0/A16003/N
http://linked.open.../vavai/riv/strany	161;168
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...vai/riv/dodaniDat	2003
http://linked.open...aciTvurceVysledku	Studený, Milan
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 teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	640629
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/02:16020195
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	essential graphs; chain graphs without flags; legal merging (en)
http://linked.open.../riv/klicoveSlovo	chain graphs without flags essential graphs legal merging
http://linked.open...ontrolniKodProRIV	[75B1D308749C]
http://linked.open...v/mistoKonaniAkce	Cuenca [ES]
http://linked.open...i/riv/mistoVydani	Cuenca
http://linked.open...i/riv/nazevZdroje	Proceedings of the First European Workshop on Probabilistic Graphical Models.
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...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (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	2002
http://linked.open...iv/tvurceVysledku	Studený, Milan
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2002-11-06 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Uncertainty methods in theoretical cybernetics: system identification, information processing, decision-making, and control
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	University of Castilla

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