Lesson plan

conditional independence

In probability theory, conditional independence describes situations in which an observation is irrelevant or redundant when evaluating the certainty of a hypothesis. It is the opposite of conditional dependence. Conditional independence is usually formulated in terms of conditional probability, as a special case where the probability of the hypothesis given the uninformative observation is equal to the probability without. If A is the hypothesis, and B and C are observations, conditional independence can be stated as an equality: : P(A\mid B,C) = P(A \mid C) where P(A \mid B, C) is the probability of A given both B and C . Since the probability of A given C is the same as the probability of A given both B and C , this equality expresses that B contributes nothing to the certainty of A . In this case, A and B are said to be conditionally independent given C , written symbolically as: (A \perp\!\!\!\perp B \mid C) . The concept of conditional independence is essential to graph-based theories of statistical inference, as it establishes a mathematical relation between a collection of conditional statements and a graphoid.

Back to article

Article summary

In probability theory, conditional independence describes situations in which an observation is irrelevant or redundant when evaluating the certainty of a hypothesis. It is the opposite of conditional dependence. Conditional independence is usually formulated in terms of conditional probability, as a special case where the probability of the hypothesis given the uninformative observation is equal to the probability without. If A is the hypothesis, and B and C are observations, conditional independence can be stated as an equality: : P(A\mid B,C) = P(A \mid C) where P(A \mid B, C) is the probability of A given both B and C . Since the probability of A given C is the same as the probability of A given both B and C , this equality expresses that B contributes nothing to the certainty of A . In this case, A and B are said to be conditionally independent given C , written symbolically as: (A \perp\!\!\!\perp B \mid C) . The concept of conditional independence is essential to graph-based theories of statistical inference, as it establishes a mathematical relation between a collection of conditional statements and a graphoid.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.