About: Graphical and Algebraic Representatives of Conditional Independence Models     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)

AttributesValues
rdf:type
Description
  • The topic of this book chapter is conditional independence models. We review mathematical objects that are used to generate conditional independence models in the area of probabilistic reasoning. More specifically, we mention undirected graphs, acyclic directed graphs, chain graphs, and an alternative algebraic approach that uses certain integer-valued vectors, named imsets. We compare the expressive power of these objects and discuss the problem of their uniqueness. In learning Bayesian networks one meets the problem of non-unique graphical description of the respective statistical model. One way to avoid this problem is to use special chain graphs, named essential graphs. An alternative algebraic approach uses certain imsets, named standard imsets, instead. We present algorithms that make it possible to transform graphical representatives into algebraic ones and conversely. The algorithms were implemented in the R language.
  • The topic of this book chapter is conditional independence models. We review mathematical objects that are used to generate conditional independence models in the area of probabilistic reasoning. More specifically, we mention undirected graphs, acyclic directed graphs, chain graphs, and an alternative algebraic approach that uses certain integer-valued vectors, named imsets. We compare the expressive power of these objects and discuss the problem of their uniqueness. In learning Bayesian networks one meets the problem of non-unique graphical description of the respective statistical model. One way to avoid this problem is to use special chain graphs, named essential graphs. An alternative algebraic approach uses certain imsets, named standard imsets, instead. We present algorithms that make it possible to transform graphical representatives into algebraic ones and conversely. The algorithms were implemented in the R language. (en)
  • Tématem této kapitoly v knize jsou gravové a algebraické modely podmíněné nezávislosti. V kapitole se konkrétně zabýváme neorientovanými a orientovanými grafy, řetězcovými grafy a alternativním algebraickým přístupem, který využívá vektory celých čísel, tak zvané imsety. (cs)
Title
  • Graphical and Algebraic Representatives of Conditional Independence Models
  • Graphical and Algebraic Representatives of Conditional Independence Models (en)
  • Grafoví a algebraičtí reprezentanti modelů podmíněné nezávislosti (cs)
skos:prefLabel
  • Graphical and Algebraic Representatives of Conditional Independence Models
  • Graphical and Algebraic Representatives of Conditional Independence Models (en)
  • Grafoví a algebraičtí reprezentanti modelů podmíněné nezávislosti (cs)
skos:notation
  • RIV/67985556:_____/07:00085219!RIV08-AV0-67985556
http://linked.open.../vavai/riv/strany
  • 55;80
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/04/0393), Z(AV0Z10750506)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 423620
http://linked.open...ai/riv/idVysledku
  • RIV/67985556:_____/07:00085219
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • graphical models; conditional indepenence (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [F1391FD03F26]
http://linked.open...i/riv/mistoVydani
  • Berlin Heildeberg
http://linked.open...i/riv/nazevZdroje
  • Advances in Probabilistic Graphical Models
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Studený, Milan
  • Vomlel, Jiří
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-68994-2
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software