Hybrid algorithms for approximate belief updating in Bayes nets
type: Item
instance of: scholarly article
title: Hybrid algorithms for approximate belief updating in Bayes nets
zbMATH Open document ID: 0939.68119
DOI: 10.1016/S0888-613X(97)00012-1
author: Yanyan Li
published in: International Journal of Approximate Reasoning
publication date: 1999-12-20T00:00:00Z
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 1381014
zbMATH Keywords: randomized algorithms
zbMATH Keywords: Bayes nets
MaRDI profile type: Publication
Wikidata QID: Q57518796
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Q3992822
cites work: Q4692508
cites work: Q3795276
cites work: Q4734791
cites work: Probabilistic Horn abduction and Bayesian networks
cites work: The role of relevance in explanation. I: Irrelevance as statistical independence
cites work: Finding MAPs for belief networks is NP-hard
cites work: Exploiting case-based independence for approximating marginal probabilities
description: scientific article; zbMATH DE number 1381014