Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

HeYangbo; JiaJinzhu; Yubin Yubin

ScienceGate Book Chapters

JOURNAL ARTICLE

Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

HeYangbo JiaJinzhu Yubin Yubin

Year: 2015 Journal: Journal of Machine Learning Research Publisher: The MIT Press

Get Full-Text PDF Get Analytical Report

Abstract

When learning a directed acyclic graph (DAG) model via observational data, one generally cannot identify the underlying DAG, but can potentially obtain a Markov equivalence class. The size (the num...

Keywords:

Directed acyclic graph Equivalence (formal languages) Mathematics Markov chain Combinatorics Discrete mathematics Directed graph Computer science Statistics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.22

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Bayesian Modeling and Causal Inference

Physical Sciences → Computer Science → Artificial Intelligence

Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

Abstract

Metrics

Topics

Related Documents

Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs

Formulas for counting acyclic digraph Markov equivalence classes

Learning Markov Equivalence Classes of Directed Acyclic Graphs: An Objective Bayes Approach

Counting and Sampling Markov Equivalent Directed Acyclic Graphs

Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs