bibtype |
C -
Conference Paper (international conference)
|
ARLID |
0331175 |
utime |
20240111140727.7 |
mtime |
20091102235959.9 |
title
(primary) (eng) |
Applying Bayesian networks in the game of Minesweeper |
specification |
page_count |
10 s. |
media_type |
WWW |
|
serial |
ARLID |
cav_un_epca*0330353 |
title
|
Proceedings of Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty |
page_num |
153-162 |
publisher |
place |
Ostrava |
name |
Universitatis Ostraviensis |
year |
2009 |
|
editor |
|
editor |
|
editor |
|
|
title
(cze) |
Aplikace bayesovských sítích ve hře Minesweepe |
keyword |
Bayesian network |
keyword |
probabilistic inference |
keyword |
tensor rank-one decomposition |
author
(primary) |
ARLID |
cav_un_auth*0209129 |
name1 |
Vomlelová |
name2 |
M. |
country |
CZ |
|
author
|
ARLID |
cav_un_auth*0101228 |
name1 |
Vomlel |
name2 |
Jiří |
institution |
UTIA-B |
full_dept |
Department of Decision Making Theory |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
source |
|
cas_special |
project |
project_id |
2C06019 |
agency |
GA MŠk |
country |
CZ |
ARLID |
cav_un_auth*0216518 |
|
project |
project_id |
1M0572 |
agency |
GA MŠk |
ARLID |
cav_un_auth*0001814 |
|
project |
project_id |
GA201/09/1891 |
agency |
GA ČR |
ARLID |
cav_un_auth*0253175 |
|
project |
project_id |
ICC/08/E010 Eurocores LogICCC |
agency |
GA ČR |
country |
XE |
ARLID |
cav_un_auth*0255499 |
|
research |
CEZ:AV0Z10750506 |
abstract
(eng) |
We use the computer game of Minesweeper to illustrate few modeling tricks utilized when applying Bayesian network (BN) models in real applications. Among others, we apply rank-one decomposition (ROD) toconditional probability tables (CPTs) representing addition. Typically, this transformation helps to reduce the computational complexity of probabilistic inference with the BN model. However, in this paper we will see that (except for the total sum node) when ROD is applied to the whole CPT it does not bring any savings for the BN model of Minesweeper. Actually, in order to gain from ROD we need minimal rank-one decompositions of CPTs when the state of the dependent variable is observed. But this is not known and it is a topic for our future research. |
abstract
(cze) |
Na počítačové hře Minesweeper ilustrujeme různé techniky používané při využití bayesovských sítí v reálných aplikacích. Mezi jinými používáme metodu rozkladu na tensory ranku jedna pro rozklad pravděpodobnostních tabulek reprezentujících sčítání. |
action |
ARLID |
cav_un_auth*0254980 |
name |
Czech-Japan Seminar on Data Analysis and Decision-Making under Uncertainty /12./ |
place |
Litomyšl |
dates |
24.09.2009-27.09.2009 |
country |
CZ |
|
reportyear |
2010 |
RIV |
BD |
permalink |
http://hdl.handle.net/11104/0176770 |
arlyear |
2009 |
mrcbU56 |
PDF |
mrcbU63 |
cav_un_epca*0330353 Proceedings of Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty 153 162 Ostrava Universitatis Ostraviensis 2009 |
mrcbU67 |
Novák V. 340 |
mrcbU67 |
Pavliska V. 340 |
mrcbU67 |
Štěpnička M. 340 |
|