Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: John Shepparden
dc.contributor.authorSturlaugson, Liessman Eric.en
dc.date.accessioned2016-01-03T17:19:19Z
dc.date.available2016-01-03T17:19:19Z
dc.date.issued2014en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/9368
dc.description.abstractThe continuous time Bayesian network (CTBN) enables reasoning about complex systems in continuous time by representing a system as a factored, finite-state, continuous-time Markov process. The dynamics of the CTBN are described by each node's conditional intensity matrices, determined by the states of the parents in the network. As the CTBN is a relatively new model, many extensions that have been defined with respect to Bayesian networks (BNs) have not yet been extended to CTBNs. This thesis presents five novel extensions to CTBN modeling and inference. First, we prove several complexity results specific to CTBNs. It is known that exact inference in CTBNs is NP-hard due to the use of a BN for the initial distribution. We prove that exact inference in CTBNs is still NP-hard, even when the initial states are given, and prove that approximate inference in CTBNs, as with BNs, is also NP-hard. Second, we formalize performance functions for the CTBN and show how they can be factored in the same way as the network, even when the performance functions are defined with respect to interaction between multiple nodes. Performance functions extend the model, allowing it to represent complex, user-specified functions of the behaviors of the system. Third, we present a novel method for node marginalization called "node isolation" that approximates a set of conditional intensity matrices with a single unconditional intensity matrix. The method outperforms previous node marginalization techniques in all of our experiments by better describing the long-term behavior of the marginalized nodes. Fourth, using the node isolation method we developed, we show how methods for sensitivity analysis of Markov processes can be applied to the CTBN while exploiting the conditional independence structure of the network. This enables efficient sensitivity analysis to be performed on our CTBN performance functions. Fifth, we formalize both uncertain and negative types of evidence in the context of CTBNs and extend existing inference algorithms to be able to support all combinations of evidence types. We show that these extensions make the CTBN more powerful, versatile, and applicable to real-world domains.en
dc.language.isoengen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshMarkov processes.en
dc.subject.lcshComputational complexity.en
dc.subject.lcshGraphical modeling (Statistics).en
dc.titleExtensions to modeling and inference in continuous time Bayesian networksen
dc.typeDissertationen
dc.rights.holderCopyright 2014 by Liessman Eric Sturlaugson.en
thesis.catalog.ckey2769779en
thesis.degree.committeemembersMembers, Graduate Committee: John Sheppard (chairperson); Qing Yang; Binhai Zhu; Tomas Gedeon; Jordy Hendrikx.en
thesis.degree.departmentComputer Science.en
thesis.degree.genreDissertationen
thesis.degree.namePhDen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage205en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record