Probabilistic inference with noisy-threshold models based on a CP tensor decomposition
From MaRDI portal
Publication:2440189
DOI10.1016/J.IJAR.2013.12.002zbMATH Open1390.68681OpenAlexW2059012310MaRDI QIDQ2440189FDOQ2440189
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
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
Multivariate analysis (62H99) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Sampling-Based Approaches to Calculating Marginal Densities
- Title not available (Why is that?)
- Title not available (Why is that?)
- A differential approach to inference in Bayesian networks
- Title not available (Why is that?)
- Bayesian Networks and Decision Graphs
- Rank of tensors of \(\ell\)-out-of-\(k\) functions: an application in probabilistic inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On probabilistic inference by weighted model counting
- Symmetric tensor decomposition
- Decomposition of quantics in sums of powers of linear forms
- Symmetric Tensors and Symmetric Tensor Rank
- Lazy propagation: A junction tree inference algorithm based on lazy evaluation
- Inverses of Vandermonde Matrices
- Title not available (Why is that?)
- The SACSO methodology for troubleshooting complex systems
- Exploiting structure in weighted model counting approaches to probabilistic inference
- Efficient computation for the noisy MAX
- Approximate inference in Bayesian networks using binary probability trees
- Learning symmetric causal independence models
- Title not available (Why is that?)
Cited In (4)
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)