Abstract
Conditional independence relations induced by discrete probabilistic distributions can be represented or approximated by relations defined on Directed Acyclic Graphs (DAGs). An alternative way for representing such relations on “Annotated Graphs” (term defined in the text) is provided. An efficient algorithm, which is an alternative version of a known algorithm, is given, for checking whether a given independency is represented in a given annotated graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
RID="*"
ID="*" This work was partially supported by NSF Grant #4-442510-21141.
The author thanks to the referees for their helpful remarks and Milan Studený for his suggestions and help in the preparation of the revised version of the paper.
Rights and permissions
About this article
Cite this article
Paz, A. An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies. Soft Computing 7, 344–349 (2003). https://doi.org/10.1007/s00500-002-0222-6
Issue Date:
DOI: https://doi.org/10.1007/s00500-002-0222-6