Probability propagation

DOI10.1007/BF01531015zbMath0875.68676MaRDI QIDQ1356197

Prakash P. Shenoy, Glenn R. Shafer

Publication date: 9 November 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

Related Items

Embedding Logics in the Local Computation Framework, New Advances in Logic-Based Probabilistic Modeling by PRISM, Topological parameters for time-space tradeoff, Perspectives on the theory and practice of belief functions, Classification using hierarchical naïve Bayes models, A simple graphical approach for understanding probabilistic inference in Bayesian networks, Importance sampling algorithms for the propagation of probabilities in belief networks, Fusion and propagation with multiple observations in belief networks, Potential influence diagrams, A comparison of graphical techniques for decision analysis, Soft evidential update for probabilistic multiagent systems, Irrelevance and parameter learning in Bayesian networks, Anytime anyspace probabilistic inference, A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques, Independence of causal influence and clique tree propagation, Unifying tree decompositions for reasoning in graphical models, Partition-based logical reasoning for first-order and propositional theories, A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem, Classification using hierarchical Naïve Bayes models, LEARNING BAYESIAN NETWORK PARAMETERS FROM SOFT DATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probability functions on complex pedigrees
• Fusion, propagation, and structuring in belief networks
• Propagating belief functions in qualitative Markov trees
• Network-based heuristics for constraint-satisfaction problems
• Triangulated graphs and the elimination process
• Nonserial dynamic programming
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Complexity of Finding Embeddings in a k-Tree