Applying Bayesian networks in the game of Minesweeper

0331175 - ÚTIA 2010 RIV CZ eng C - Conference Paper (international conference)
Vomlelová, M. - Vomlel, Jiří
Applying Bayesian networks in the game of Minesweeper.
[Aplikace bayesovských sítích ve hře Minesweepe.]
Proceedings of Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty. Ostrava: Universitatis Ostraviensis, 2009 - (Novák, V.; Pavliska, V.; Štěpnička, M.), s. 153-162
[Czech-Japan Seminar on Data Analysis and Decision-Making under Uncertainty /12./. Litomyšl (CZ), 24.09.2009-27.09.2009]
R&D Projects: GA MŠMT 1M0572; GA ČR GA201/09/1891
Grant - others:GA MŠk(CZ) 2C06019; GA ČR(XE) ICC/08/E010 Eurocores LogICCC
Institutional research plan: CEZ:AV0Z10750506
Keywords : Bayesian network * probabilistic inference * tensor rank-one decomposition
Subject RIV: BD - Theory of Information
http://library.utia.cas.cz/separaty/2009/MTR/vomlel-applying bayesian networks in the game of minesweeper.pdf

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.

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í.
Permanent Link: http://hdl.handle.net/11104/0176770