Please use this identifier to cite or link to this item:
|Title:||A dynamic programming algorithm for learning chain event graphs|
|Keywords:||chain event graphs|
|Citation:||Silander, T.,Leong, T.-Y. (2013). A dynamic programming algorithm for learning chain event graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8140 LNAI : 201-216. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-40897-7_14|
|Abstract:||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 provides clues for implementing more scalable heuristic algorithms. © 2013 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2018
checked on Oct 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.