Optimizing Causal Orderings for Generating DAGs from Data

Preprint

13 March 2013

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.1303.5392

Abstract

An algorithm for generating the structure of a directed acyclic graph from data using the notion of causal input lists is presented. The algorithm manipulates the ordering of the variables with operations which very much resemble arc reversal. Operations are only applied if the DAG after the operation represents at least the independencies represented by the DAG before the operation until no more arcs can be removed from the DAG. The resulting DAG is a minimal l-map.

Keywords

INDEPENDENCIES REPRESENTED
ALGORITHM MANIPULATES
OPERATION REPRESENTS
OPTIMIZING CAUSAL
CAUSAL ORDERINGS
GENERATING DAGS
RESEMBLE ARC

All Related Versions

Version 1, 2013-03-13, ArXiv

This publication has 0 references indexed in Scilit: