Unsupervised evolutionary algorithm for dynamic Bayesian network structure learning

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The introduction of temporal dimension makes it difficult and complex to learn dynamic Bayesian network (DBN) structure for huge search space, hence many studies focus on some particular types of DBN, such as dynamic Naive Bayesian Classifier (DNBC). In order to overcome the limited applicability of DBN structure learning methods, this paper proposes an unsupervised evolutionary algorithm in which the selection of initial population has been implemented by means of mutual information to reduce the search space. Furthermore, in view of the poor performance of traditional encoding scheme and the recount of Bayesian information criterion (BIC) score when calculating the individual fitness, we provide a new structure representation without a necessity of the acyclicity test and an updating algorithm for BIC scores with the help of family inheritance to improve the efficiency. Simulations on synthetic data demonstrate that the proposed unsupervised evolutionary algorithm is effective in DBN structure learning.

Cite

CITATION STYLE

APA

Dai, J., & Ren, J. (2015). Unsupervised evolutionary algorithm for dynamic Bayesian network structure learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9505, pp. 136–151). Springer Verlag. https://doi.org/10.1007/978-3-319-28379-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free