Home > Search Results: keywords:"annotated graphs essential graphs characteristic imsets Bayesian networks"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Anotační grafy a Bayesovské sítě
 Čoupková, Evženie ; Studený, Milan (advisor) ; Antoch, Jaromír (referee)
There are different models, which describe conditional independence induced by multivariate distributions. Models such as Undirected Graphs, Directed Acyclic Graphs, Essential Graphs and Annotated Graphs are introduced and compared in this thesis. The focus is put on annotated graphs. It is shown that annotated graphs represent equivalence classes of DAG-representable relations. An algorithm for reconstruction of an annotated graph from an essential graph as well as the algorithm for the inverse procedure are given. Some properties of a characteristic imset, which is a non-graphical representation, are discussed. A relationship between annotated graphs and characteristic imsets is investigated, an algorithm, which reconstructs an annotated graph from a characteristic imset is given. Powered by TCPDF (www.tcpdf.org)
Detailed record
Anotační grafy a Bayesovské sítě
 Čoupková, Evženie ; Studený, Milan (advisor) ; Antoch, Jaromír (referee)
There are different models, which describe conditional independence induced by multivariate distributions. Models such as Undirected Graphs, Directed Acyclic Graphs, Essential Graphs and Annotated Graphs are introduced and compared in this thesis. The focus is put on annotated graphs. It is shown that annotated graphs represent equivalence classes of DAG-representable relations. An algorithm for reconstruction of an annotated graph from an essential graph as well as the algorithm for the inverse procedure are given. Some properties of a characteristic imset, which is a non-graphical representation, are discussed. A relationship between annotated graphs and characteristic imsets is investigated, an algorithm, which reconstructs an annotated graph from a characteristic imset is given. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English