A Polynomial Algorithm for Deciding Equivalence in Directed Acyclic Graphical Models
Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)Published 29 June 2018Open access
Thomas Richardson
Citations1
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A feasible characterization of the class of Directed Cyclic Graphical models (DCGs) which entail, in virtue of their structure, the same conditional independencies are given.
Abstract
Thomas Richardson. A Polynomial Algorithm for Deciding Equivalence in Directed Acyclic Graphical Models.
Keywords
Computer Science
TechnometricsGraphical Models in Applied Multivariate Statistics
1,827 Citations1991Colin Goodall, Joe Whittaker
Proceedings of the IREFeedback Theory-Further Properties of Signal Flow Graphs
703 Citations1956Samuel J. Mason
Statistical ScienceLinear Dependencies Represented by Chain Graphs
257 Citations1993D. R. Cox, Nanny Wermuth