摘要
Bayesian network structure learning is one of the important research techniques in the domain of data mining and knowledge discovery, when the search space of the network structure is bigger, traditional binary particle algorithms often have some defects such as low convergent speed, falling easily into local optimum and low precision. We improve the classic binary particle swarm optimization algorithm in two respects: particle initialization and update process; the improved algorithm has stronger optimization ability. We compare the proposed algorithm with the original algorithm using the ASIA network. The results and their analysis show preliminarily that the proposed algorithm is able to find the better solution with less number of iterations, without increasing the complexity basically.
源语言 | 英语 |
---|---|
页(从-至) | 749-755 |
页数 | 7 |
期刊 | Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University |
卷 | 32 |
期 | 5 |
出版状态 | 已出版 - 1 10月 2014 |