Number of the records: 1
Applying Bayesian networks in the game of Minesweeper
- 1.
SYSNO ASEP 0331175 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Applying Bayesian networks in the game of Minesweeper Title Aplikace bayesovských sítích ve hře Minesweepe Author(s) Vomlelová, M. (CZ)
Vomlel, Jiří (UTIA-B) RID, ORCIDSource Title 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. Pages s. 153-162 Number of pages 10 s. Publication form WWW - WWW Action Czech-Japan Seminar on Data Analysis and Decision-Making under Uncertainty /12./ Event date 24.09.2009-27.09.2009 VEvent location Litomyšl Country CZ - Czech Republic Event type WRD Language eng - English Country CZ - Czech Republic Keywords Bayesian network ; probabilistic inference ; tensor rank-one decomposition Subject RIV BD - Theory of Information R&D Projects 1M0572 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) GA201/09/1891 GA ČR - Czech Science Foundation (CSF) CEZ AV0Z10750506 - UTIA-B (2005-2011) Annotation 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. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2010
Number of the records: 1