Recursive conditioning

By Adnan Darwiche. Artificial Intelligence, 2001

302 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Signal Processing

View Paper: https://www.semanticscholar.org/paper/e4a9da1f8f48b3cd8c7b7648c897df1b2766ffe7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Signal Processing

Citations in the corpus

Bayesian Networks and Decision Graphs (2001, unknown): “Recursive conditioning was introduced in (Darwiche, 2001).”
On probabilistic inference by weighted model counting (2008, methodology): “A dtree for a Bayesian network is simply a binary tree whose leaves correspond to the network CPTs [8].”
Learning Bayesian networks: approaches and issues (2011, methodology): “Other researchers have designed methods to try to alleviate the problems of conditioning; for more information see, for example, Dı́ez (1996), Shachter et al. (1994) and Darwiche (1995, 2001b).”
Component Caching in Hybrid Domains with Piecewise Polynomial Densities (2016, unknown): “In a probabilistic context, CC closely matches the competitiveness of approaches such as recursive conditioning (Darwiche 2001) and bucket elimination (Dechter 1996).”
Bayesian Networks (2008, unknown): “A third class of exact inference algorithms is based on the concept of conditioning [129] [130] [39] [81] [162] [152] [37] [52].”
Importance sampling-based estimation over AND/OR search spaces for graphical models (2012, methodology): “Recently, graph based problem decompositions were introduced for systematic search in graphical models (Darwiche, 2001; Bacchus, Dalmao, and Pitassi, 2003) and captured using the notion of AND/OR search spaces (Dechter and Mateescu, 2007).”
Dynamic Graphical Models (2010, methodology): “Since the separator was optimized, the notion of the left or right interface [12], [4], [28], [19], [3] is no longer relevant since after the aforementioned max-flow optimization they are identical.”
Performing Bayesian Inference by Weighted Model Counting (2005, methodology): “…compare the operation of the Cachet-based model-counting approach (MC) with similar conditioning algorithms, in particular recursive conditioning (RC) (Darwiche 2001; Allen and Darwiche 2003), value elimination (VE) (Bacchus et al. 2003b), and classical cutset conditioning (CC) (Dechter 1990).”