DocumentCode :
257493
Title :
DBN structure learning based on MI-BPSO algorithm
Author :
Guoliang Li ; Xiaoguang Gao ; Ruohai Di
Author_Institution :
Sch. of Electron. & Inf., Northwestern Polytech. Univ., Xi´an, China
fYear :
2014
fDate :
4-6 June 2014
Firstpage :
245
Lastpage :
250
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.
Keywords :
belief networks; convergence; learning (artificial intelligence); particle swarm optimisation; search problems; DBN internetwork; DBN intranetwork; DBN structure learning; MI-BPSO algorithm; conditional probability tables; constrained space search; directed acyclic graph structure; dynamic Bayesian network; graph theories; mutual information-binary particle swarm optimization; probability theories; searching phase; Accuracy; Algorithm design and analysis; Asia; Bayes methods; Heuristic algorithms; Mutual information; Particle swarm optimization; binary particle swarm optimization; dynamic Bayesian network; mutual information; structure learning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Science (ICIS), 2014 IEEE/ACIS 13th International Conference on
Conference_Location :
Taiyuan
Type :
conf
DOI :
10.1109/ICIS.2014.6912142
Filename :
6912142
Link To Document :
بازگشت