Reasoning with probabilistic and deterministic graphical models. Exact algorithms
DOI10.2200/S00529ED1V01Y201308AIM023zbMATH Open1297.68006OpenAlexW2080430334MaRDI QIDQ5416752FDOQ5416752
Authors: Rina Dechter 
Publication date: 15 May 2014
Published in: Synthesis Lectures on Artificial Intelligence and Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2200/s00529ed1v01y201308aim023
Recommendations
Bayesian networksgraphical modelsinferenceconditioningknowledge representationreasoningtree-widthvariable eliminationMarkov networksconstraint networksAND/OR searchpseudo-treebucket eliminationcycle-cutsetinduced width
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Pattern recognition, speech recognition (68T10) Graphical methods in statistics (62A09) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)
Cited In (7)
- Probabilistic Reasoning in Multiagent Systems
- Subproblem ordering heuristics for AND/OR best-first search
- Generic inference. A unifying theory for automated reasoning
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- Weighted positive binary decision diagrams for exact probabilistic inference
- Computing partial hypergraphs of bounded width
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
This page was built for publication: Reasoning with probabilistic and deterministic graphical models. Exact algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5416752)
