Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ancestral_graph> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Ancestral_graph abstract "An ancestral graph is a graph with three types of edges: directed edge, bidirected edge, and undirected edge such that it can be decomposed into three parts: an undirected subgraph, a directed subgraph, and directed edges pointing from the undirected subgraph to the directed subgraph.An ancestral graph G over nodes V is maximal if for every pair (x, y) of non-adjacent nodes in G, there exists a set Z of nodes in V \{x, y} such that x and y are m-separated by Z in G.In statistics, an ancestral graph can be used to represent the statistical dependencies, and notional causative effects, between random variables.".
- Ancestral_graph wikiPageID "2938319".
- Ancestral_graph wikiPageRevisionID "584813723".
- Ancestral_graph hasPhotoCollection Ancestral_graph.
- Ancestral_graph subject Category:Extensions_and_generalizations_of_graphs.
- Ancestral_graph subject Category:Graphical_models.
- Ancestral_graph subject Category:Multivariate_statistics.
- Ancestral_graph type Assistant109815790.
- Ancestral_graph type CausalAgent100007347.
- Ancestral_graph type GraphicalModels.
- Ancestral_graph type LivingThing100004258.
- Ancestral_graph type Model110324560.
- Ancestral_graph type Object100002684.
- Ancestral_graph type Organism100004475.
- Ancestral_graph type Person100007846.
- Ancestral_graph type PhysicalEntity100001930.
- Ancestral_graph type Whole100003553.
- Ancestral_graph type Worker109632518.
- Ancestral_graph type YagoLegalActor.
- Ancestral_graph type YagoLegalActorGeo.
- Ancestral_graph comment "An ancestral graph is a graph with three types of edges: directed edge, bidirected edge, and undirected edge such that it can be decomposed into three parts: an undirected subgraph, a directed subgraph, and directed edges pointing from the undirected subgraph to the directed subgraph.An ancestral graph G over nodes V is maximal if for every pair (x, y) of non-adjacent nodes in G, there exists a set Z of nodes in V \{x, y} such that x and y are m-separated by Z in G.In statistics, an ancestral graph can be used to represent the statistical dependencies, and notional causative effects, between random variables.".
- Ancestral_graph label "Ancestral graph".
- Ancestral_graph sameAs m.08dypb.
- Ancestral_graph sameAs Q4752562.
- Ancestral_graph sameAs Q4752562.
- Ancestral_graph sameAs Ancestral_graph.
- Ancestral_graph wasDerivedFrom Ancestral_graph?oldid=584813723.
- Ancestral_graph isPrimaryTopicOf Ancestral_graph.