Directed Graphs and Conditional Independence

  • Wasserman L
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A directed graph consists of a set of nodes with arrows between some nodes. An example is shown in Figure 17.1.

Cite

CITATION STYLE

APA

Wasserman, L. (2004). Directed Graphs and Conditional Independence (pp. 263–279). https://doi.org/10.1007/978-0-387-21736-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free