An approximate tensor-based inference method applied to the game of Minesweeper

DOI10.1007/978-3-319-11433-0_35MaRDI QIDQ2938430zbMATH OpenOpenAlexFDO

Authors Jiří Vomlel, Petr Tichavský

Publication date 14 January 2015

Published in Probabilistic Graphical Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11433-0_35

zbMATH Keywords

Bayesian networksCP tensor decompositionprobabilistic inferencesymmetric tensor rank

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Games involving graphs (91A43)

Recommendations

• Probabilistic inference with noisy-threshold models based on a CP tensor decomposition
• Rank of tensors of -out-of-k functions: an application in probabilistic inference
• scientific article; zbMATH DE number 5269047
• Decomposition and approximation of loopy Bayesian networks
• Tensor decompositions and sparse log-linear models

Cited in

(4)

• Direct causal structure extraction from pairwise interaction patterns in NAT modeling Bayesian networks
• Probabilistic inference with noisy-threshold models based on a CP tensor decomposition
• Rank of tensors of -out-of-k functions: an application in probabilistic inference
• Learning tractable NAT-modeled Bayesian networks

This page was built for publication: An approximate tensor-based inference method applied to the game of Minesweeper

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938430)