Local Monotonicity in Probabilistic Networks

DOI10.1007/978-3-540-75256-1_49MaRDI QIDQ3524964zbMATHOpenAlexFDO

Authors Johan Kwisthout, Gerard Tel, Hans L. Bodlaender

Publication date 16 September 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-75256-1_49

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• The Computational Complexity of Monotonicity in Probabilistic Networks
• Attaining monotonicity for Bayesian networks
• On the sample monotonization problem
• scientific article; zbMATH DE number 1735979
• Local structure learning in graphical models

Cites work

• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Approximate solution of NP optimization problems
• Completeness in approximation classes
• Fundamental concepts of qualitative probabilistic networks
• Optimization, approximation, and complexity classes
• Scheduling independent tasks to reduce mean finishing time

Cited in

(5)

• Disentangling relationships in symptom networks using matrix permutation methods
• Attaining monotonicity for Bayesian networks
• Monotonicity in Bayesian networks for computerized adaptive testing
• The Computational Complexity of Monotonicity in Probabilistic Networks
• Optimal monotone relabelling of partially non-monotone ordinal data

This page was built for publication: Local Monotonicity in Probabilistic Networks

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