Inference by Factor Elimination

Adnan DarwicheCambridge 2009 · DOI · OpenAlex

Abstract

We present in this chapter a variation on the variable elimination algorithm, known as the jointree algorithm, which can be understood in terms of factor elimination. This algorithm improves on the complexity of variable elimination when answering multiple queries. It also forms the basis for a class of approximate inference algorithms that we discuss in Chapter 14.
BibTeX
@inproceedings{darwiche2009inference,
  author = {Adnan Darwiche},
  title = {{Inference by Factor Elimination}},
  booktitle = {Cambridge},
  year = {2009},
  doi = {10.1017/cbo9780511811357.008},
}

Loading related content...

Figure