A factorization criterion for acyclic directed mixed graphs.
Thomas S. RichardsonPublished in: CoRR (2014)
Keyphrases
- markov equivalence classes
- equivalence class
- equivalence classes
- connected graphs
- graph matching
- directed acyclic graph
- kronecker product
- np complete
- bounded treewidth
- pairwise
- optimization criterion
- graph construction
- graph theory
- graph partitioning
- special case
- graph structure
- network structure
- matrix factorization
- image segmentation
- causal ordering
- np hard
- tensor factorization
- singular value decomposition
- directed graph
- random graphs
- graph clustering
- graph theoretic
- graph model
- graph mining