AND/OR Cutset Conditioning
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 230-234.
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 wcutset 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.
@inproceedings{ijcai2005p220,
title = {AND/OR Cutset Conditioning},
author = {Mateescu, Robert and Dechter, Rina},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {230--234},
year = {2005},
url = {https://ijcai.org/proceedings/2005/220},
}
TY - CPAPER TI - AND/OR Cutset Conditioning AU - Mateescu, Robert AU - Dechter, Rina T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 230 EP - 234 UR - https://ijcai.org/proceedings/2005/220 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: