A Dynamic Programming Algorithm for Learning Chain Event Graphs
Chain event graphs are a model family particularly suited for asymmetric causal discrete domains. This paper describes a dynamic programming algorithm for exact learning of chain event graphs from multivariate data. While the exact algorithm is slow, it allows reasonably fast approximations and prov...
Saved in:
Main Authors: | Silander T., Tze-Yun LEONG |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2013
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2985 http://link.springer.com/chapter/10.1007%2F978-3-642-40897-7_14 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A dynamic programming algorithm for learning chain event graphs
by: Silander, T., et al.
Published: (2014) -
Verification of graph programs
by: POSKITT, Christopher M.
Published: (2012) -
Verifying monadic second-order properties of graph programs
by: POSKITT, Christopher M., et al.
Published: (2014) -
Learning algorithm for the uniform graph partitioning problem
by: Chua, C.B., et al.
Published: (2014) -
Accelerating dynamic graph analytics on GPUs
by: SHAN, Mo, et al.
Published: (2017)