The L-separation criterion for description of cs-independence models

  • Vantaggi B
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 18

    Citations

    Citations of this article.

Abstract

Different conditional independence models have been proposed in literature; in this paper we consider models induced by conditional probabilities based on the definition of conditional cs-independence. These models need not comply with the symmetry property, so that they have not the graphoid structure. Hence, the well-known d-separation criterion for directed acyclic graphs may not be able to represent such independence models. Therefore, we introduce a new separation criterion called L-separation. We study its main properties and show how it allows to represent the above-mentioned independence models through directed acyclic graphs. © 2002 Elsevier Science Inc. All rights reserved.

Author-supplied keywords

  • Conditional independence
  • Conditional probability
  • Graphical models
  • Graphoid properties
  • Logical independence
  • Separation criterion

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free