AND/OR Cutset Conditioning
Abstract
Cutset conditioning is one of the methods of solving reasoning tasks for graphical models, especially when space restrictions make inference (e.g., jointree-clustering) algorithms infeasible. The w-cutset is a natural extension of the method to a hybrid algorithm that performs search on the conditioning variables and inference on the remaining problems of induced width bounded by w. This paper takes a fresh look at these methods through the spectrum of AND/OR search spaces for graphical models. The resulting AND/OR cutset method is a strict improvement over the traditional one, often by exponential amounts.
Cite
Text
Mateescu and Dechter. "AND/OR Cutset Conditioning." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Mateescu and Dechter. "AND/OR Cutset Conditioning." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/mateescu2005ijcai-cutset/)BibTeX
@inproceedings{mateescu2005ijcai-cutset,
title = {{AND/OR Cutset Conditioning}},
author = {Mateescu, Robert and Dechter, Rina},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {230-235},
url = {https://mlanthology.org/ijcai/2005/mateescu2005ijcai-cutset/}
}