bibtype |
J -
Journal Article
|
ARLID |
0535808 |
utime |
20240903170647.0 |
mtime |
20201208235959.9 |
WOS |
000596316600002 |
SCOPUS |
85100175531 |
DOI |
10.14736/kyb-2020-5-0850 |
title
(primary) (eng) |
Contribution of František Matúš to the research on conditional independence |
specification |
page_count |
25 s. |
media_type |
P |
|
serial |
ARLID |
cav_un_epca*0297163 |
ISSN |
0023-5954 |
title
|
Kybernetika |
volume_id |
56 |
volume |
5 (2020) |
page_num |
850-874 |
publisher |
name |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
|
keyword |
conditional independence |
keyword |
matroid |
keyword |
polymatroid |
keyword |
entropy function |
keyword |
semigraphoid |
keyword |
semimatroid |
author
(primary) |
ARLID |
cav_un_auth*0101202 |
name1 |
Studený |
name2 |
Milan |
institution |
UTIA-B |
full_dept (cz) |
Matematická teorie rozhodování |
full_dept (eng) |
Department of Decision Making Theory |
department (cz) |
MTR |
department (eng) |
MTR |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
source |
|
source |
|
cas_special |
project |
project_id |
GA19-04579S |
agency |
GA ČR |
country |
CZ |
ARLID |
cav_un_auth*0380558 |
|
abstract
(eng) |
An overview of results of F. Matus on probabilistic conditional independence (CI) is given. First, his axiomatic characterizations of stochastic functional dependence and unconditional independence are recalled. Then his elegant proof of discrete probabilistic representability of a matroid based on its linear representability over a finite field is recalled. It is explained that this result was a basis of his methodology for constructing a probabilistic representation of a given abstract CI structure. His embedding of matroids into (augmented) abstract CI structures is recalled. The contribution of his to the theory of semigraphoids is mentioned, too. Finally, his results on the characterization of probabilistic CI structures induced by 4 discrete random variables and by 4 regular Gaussian random variables are recalled. Partial probabilistic representability by binary random variables is also mentioned. |
result_subspec |
WOS |
RIV |
BA |
FORD0 |
10000 |
FORD1 |
10100 |
FORD2 |
10101 |
reportyear |
2021 |
num_of_auth |
1 |
inst_support |
RVO:67985556 |
permalink |
http://hdl.handle.net/11104/0314146 |
confidential |
S |
mrcbC86 |
3+4 Article Computer Science Cybernetics |
mrcbC91 |
A |
mrcbT16-e |
COMPUTERSCIENCECYBERNETICS |
mrcbT16-i |
0.00083 |
mrcbT16-j |
0.262 |
mrcbT16-s |
0.218 |
mrcbT16-B |
14.97 |
mrcbT16-D |
Q4 |
mrcbT16-E |
Q4 |
arlyear |
2020 |
mrcbU14 |
85100175531 SCOPUS |
mrcbU24 |
PUBMED |
mrcbU34 |
000596316600002 WOS |
mrcbU63 |
cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 56 č. 5 2020 850 874 Ústav teorie informace a automatizace AV ČR, v. v. i. |
|