“Ancestral graph”的意思、由来-开放百科全书

词条

Ancestral graph

释义

Definition
Applications
References

In statistics and Markov modeling, an ancestral graph is a type of mixed graph to provide a graphical representation for the result of marginalizing one or more vertices in a graphical model that takes the form of a directed acyclic graph.

Definition

Ancestral graphs are mixed graphs used with three kinds of edges: directed edges, drawn as an arrow from one vertex to another, bidirected edges, which have an arrowhead at both ends, and undirected edges, which have no arrowheads. It is required to satisfy some additional constraints:

If there is an edge from a vertex u to another vertex v, with an arrowhead at v (that is, either an edge directed from u to v or a bidirected edge), then there does not exist a path from v to u consisting of undirected edges and/or directed edges oriented consistently with the path.
If a vertex v is an endpoint of an undirected edge, then it is not also the endpoint of an edge with an arrowhead at v.

Applications

Ancestral graphs are used to depict conditional independence relations between variables in Markov models.^[1]

References

1. ^{{citation | last1 = Richardson | first1 = Thomas | last2 = Spirtes | first2 = Peter | doi = 10.1214/aos/1031689015 | issue = 4 | journal = The Annals of Statistics | mr = 1926166 | pages = 962–1030 | title = Ancestral graph Markov models | volume = 30 | year = 2002| citeseerx = 10.1.1.33.4906 }}

2 : Extensions and generalizations of graphs|Graphical models

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。