Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

DOI10.1007/11548669MaRDI QIDQ5394515zbMATH OpenOpenAlexFDO

Authors Dan Wu, Cory J. Butz

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11548669

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 1983173
• The computational complexity of probabilistic inference using Bayesian belief networks
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Finding MAPs for belief networks is NP-hard

Cited in

(7)

• The computational complexity of probabilistic inference using Bayesian belief networks
• Uniqueness of the level two Bayesian network representing a probability distribution
• The Computational Complexity of Monotonicity in Probabilistic Networks
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
• scientific article; zbMATH DE number 1983173 (Why is no real title available?)
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
• Approximate belief updating in max-2-connected Bayes networks is NP-hard

This page was built for publication: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

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