Probabilistic inference with noisy-threshold models based on a CP tensor decomposition

DOI10.1016/J.IJAR.2013.12.002MaRDI QIDQ2440189zbMATH OpenOpenAlexFDO

Authors Jiří Vomlel, Petr Tichavský

Publication date 27 March 2014

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2013.12.002

zbMATH Keywords

Bayesian networksprobabilistic inferencesymmetric tensor rankCandecomp-Parafac tensor decomposition

Mathematics Subject Classification ID

Multivariate analysis (62H99) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 5269047
• Rank of tensors of \(\ell\)-out-of-\(k\) functions: an application in probabilistic inference
• An approximate tensor-based inference method applied to the game of Minesweeper
• Provable learning of noisy-OR networks
• Tensor decompositions and sparse log-linear models

Cites work

• scientific article; zbMATH DE number 1634667 (Why is no real title available?)
• scientific article; zbMATH DE number 4178809 (Why is no real title available?)
• scientific article; zbMATH DE number 1222283 (Why is no real title available?)
• scientific article; zbMATH DE number 1149408 (Why is no real title available?)
• scientific article; zbMATH DE number 1553119 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 5269047 (Why is no real title available?)
• scientific article; zbMATH DE number 4189243 (Why is no real title available?)
• A differential approach to inference in Bayesian networks
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Approximate inference in Bayesian networks using binary probability trees
• Bayesian Networks and Decision Graphs
• Decomposition of quantics in sums of powers of linear forms
• Efficient computation for the noisy MAX
• Exploiting structure in weighted model counting approaches to probabilistic inference
• Inverses of Vandermonde Matrices
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• Learning symmetric causal independence models
• On probabilistic inference by weighted model counting
• Rank of tensors of \(\ell\)-out-of-\(k\) functions: an application in probabilistic inference
• Sampling-Based Approaches to Calculating Marginal Densities
• Symmetric Tensors and Symmetric Tensor Rank
• Symmetric tensor decomposition
• The SACSO methodology for troubleshooting complex systems

Cited in

(4)

• A Bayesian network interpretation of the Cox's proportional hazard model
• Robustifying sum-product networks
• An approximate tensor-based inference method applied to the game of Minesweeper
• Rank of tensors of \(\ell\)-out-of-\(k\) functions: an application in probabilistic inference

This page was built for publication: Probabilistic inference with noisy-threshold models based on a CP tensor decomposition

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