bibtype J - Journal Article
ARLID 0391079
utime 20240103202414.6
mtime 20130320235959.9
WOS 000317379600002
SCOPUS 84875754942
DOI 10.1016/j.ijar.2013.01.002
title (primary) (eng) Probabilistic Compositional Models: solution of an equivalence problem
specification
page_count 12 s.
media_type P
serial
ARLID cav_un_epca*0256774
ISSN 0888-613X
title International Journal of Approximate Reasoning
volume_id 54
volume 5 (2013)
page_num 590-601
publisher
name Elsevier
keyword Probabilistic model
keyword Compositional model
keyword Independence
keyword Equivalence
author (primary)
ARLID cav_un_auth*0216188
name1 Kratochvíl
name2 Václav
full_dept (cz) Matematická teorie rozhodování
full_dept (eng) Department of Decision Making Theory
department (cz) MTR
department (eng) MTR
institution UTIA-B
full_dept Department of Decision Making Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
url http://library.utia.cas.cz/separaty/2013/MTR/kratochvil-0391079.pdf
cas_special
project
project_id GA13-20012S
agency GA ČR
ARLID cav_un_auth*0292670
abstract (eng) Probabilistic compositional models, similarly to graphical Markov models, are able to represent multidimensional probability distributions using factorization and closely related concept of conditional independence. Compositional models represent an algebraic alternative to the graphical models. The system of related conditional independencies is not encoded explicitly (e.g. using a graph) but it is hidden in a model structure itself. This paper provides answers to the question how to recognize whether two different compositional model structures are equivalent - i.e. whether they induce the same system of conditional independencies. Above that, it provides an easy way to convert one structure into an equivalent one in terms of some elementary operations on structures, closely related ability to generate all structures equivalent with a given one, and a unique representative of a class of equivalent structures.
reportyear 2014
RIV BA
num_of_auth 1
mrcbC52 4 A 4a 20231122135552.2
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0219989
mrcbT16-e COMPUTERSCIENCEARTIFICIALINTELLIGENCE
mrcbT16-f 2.072
mrcbT16-g 0.489
mrcbT16-h 5.VIII
mrcbT16-i 0.00519
mrcbT16-j 0.656
mrcbT16-k 1912
mrcbT16-l 90
mrcbT16-s 1.145
mrcbT16-4 Q1
mrcbT16-B 64.744
mrcbT16-C 76.446
mrcbT16-D Q2
mrcbT16-E Q2
arlyear 2013
mrcbTft \nSoubory v repozitáři: kratochvil-0391079.pdf
mrcbU14 84875754942 SCOPUS
mrcbU34 000317379600002 WOS
mrcbU63 cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 54 č. 5 2013 590 601 Elsevier