DBN structure learning based on MI-BPSO algorithm

Guoliang Li, Xiaoguang Gao, Ruohai Di

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

To improve the accuracy of structure learning for Dynamic Bayesian Network (DBN), this paper proposes Mutual Information-Binary Particle Swarm Optimization (MI-BPSO) algorithm. The MI-BPSO algorithm firstly uses MI and conditional independence test to prune the search space and speed up the convergence of the searching phase, then calls BPSO algorithm to search the constrained space and get the intra-network and inter-network of DBN. Experimental results show that this algorithm performs as well as K2 while it doesn't need a given variable ordering, and performs better than MWST-GES, MWST-HC and I-BN-PSO.

Original languageEnglish
Title of host publication2014 IEEE/ACIS 13th International Conference on Computer and Information Science, ICIS 2014 - Proceedings
EditorsYan Han, Wenai Song, Simon Xu, Lichao Chen, Roger Lee
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages245-250
Number of pages6
ISBN (Electronic)9781479948604
DOIs
StatePublished - 26 Sep 2014
Event2014 13th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2014 - Proceedings - Taiyuan, China
Duration: 4 Jun 20146 Jun 2014

Publication series

Name2014 IEEE/ACIS 13th International Conference on Computer and Information Science, ICIS 2014 - Proceedings

Conference

Conference2014 13th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2014 - Proceedings
Country/TerritoryChina
CityTaiyuan
Period4/06/146/06/14

Keywords

  • binary particle swarm optimization
  • dynamic Bayesian network
  • mutual information
  • structure learning

Fingerprint

Dive into the research topics of 'DBN structure learning based on MI-BPSO algorithm'. Together they form a unique fingerprint.

Cite this