A factorization criterion for acyclic directed mixed graphs.
Thomas S. RichardsonPublished in: UAI (2009)
Keyphrases
- markov equivalence classes
- equivalence class
- equivalence classes
- directed acyclic graph
- np hard
- connected graphs
- kronecker product
- graph matching
- bounded treewidth
- singular value decomposition
- np complete
- database schemes
- graph databases
- minimum description length
- graph theory
- random graphs
- directed graph
- graph representation
- graph structure
- optimization criterion
- undirected graph
- graph mining
- bipartite graph
- image sequences