Conditional Independence
Author information unavailable
Abstract
Author information unavailable
Abstract
Conditional independence constraints are simple and intuitive restrictions on probability distributions that express the notion that two sets of random variables are unrelated, typically given knowledge of the values of a third set of random variables. A conditional independence model is a family of probability distributions that satisfy a collection of conditional independence constraints. In this chapter we explore the algebraic structure of conditional independence models in the case of discrete or jointly Gaussian random variables. Conditional independence models defined by graphs, known as graphical models , are given particular emphasis. Undirected graphical models are also known as Markov random fields , whereas directed graphical models are often termed Bayesian networks . These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Conditional independence constraints are simple and intuitive restrictions on probability distributions that express the notion that two sets of random variables are unrelated, typically given knowledge of the values of a third set of random variables. A conditional independence model is a family of probability distributions that satisfy a collection of conditional independence constraints. In this chapter we explore the algebraic structure of conditional independence models in the case of discrete or jointly Gaussian random variables. Conditional independence models defined by graphs, known as graphical models , are given particular emphasis. Undirected graphical models are also known as Markov random fields , whereas directed graphical models are often termed Bayesian networks . These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Key concepts: Conditional independence, Graphical model, Independence (probability theory), Conditional dependence, Bayesian network, Random variable, Regular conditional probability, Conditional probability