bibtype |
J -
Journal Article
|
ARLID |
0411275 |
utime |
20240103182314.6 |
mtime |
20060210235959.9 |
title
(primary) (eng) |
Characterization of inclusion neighbourhood in terms of the essential graph |
specification |
|
serial |
ARLID |
cav_un_epca*0256774 |
ISSN |
0888-613X |
title
|
International Journal of Approximate Reasoning |
volume_id |
38 |
volume |
3 (2005) |
page_num |
283-309 |
publisher |
|
|
title
(cze) |
Charakterizace inlusion-okolí v termínech esenciálního grafu |
keyword |
learning Bayesian networks |
keyword |
inclusion neighbourhood |
keyword |
essential graph |
author
(primary) |
ARLID |
cav_un_auth*0101202 |
full_dept |
Department of Decision Making Theory |
name1 |
Studený |
name2 |
Milan |
institution |
UTIA-B |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
source |
|
COSATI |
12A |
cas_special |
project |
ARLID |
cav_un_auth*0001808 |
project_id |
GA201/04/0393 |
agency |
GA ČR |
|
project |
ARLID |
cav_un_auth*0001799 |
project_id |
IAA1075104 |
agency |
GA AV ČR |
|
research |
CEZ:AV0Z10750506 |
abstract
(eng) |
The motivation of the problem solved in the paper is learning Bayesian networks. Neighbouring equivalence classes of a given equivalence class of Bayesian networks in the sense of so-called inclusion neighbourhood are characterized efficiently in terms of the respective standard representative of the equivalence class, which is named the essential graph. |
abstract
(cze) |
Motivace řešeného problému je učení Bayesovských sítí. Jsou charakterizovány sousední třídy ekvivalence dané třídy ekvivalence Bayesovských sítí ve smyslu inclusion-okolí a to v termínech standardního reprezentanta oné třídy ekvivalence, nazývaného esenciální graf. |
RIV |
BA |
reportyear |
2006 |
department |
MTR |
permalink |
http://hdl.handle.net/11104/0131358 |
ID_orig |
UTIA-B 20050002 |
arlyear |
2005 |
mrcbU63 |
cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 38 č. 3 2005 283 309 Elsevier |
|