An Ant Colony Optimization Algorithm Merged With Multiple Source Information for Learning Brain Effective Connectivity Networks

被引：0
|
作者：
Ji J.-Z. [1 ]
Liu J.-D. [1 ]
Zou A.-X. [1 ]
Yang C.-C. [1 ]
机构：
[1] Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Faculty of Information Technology, Beijing University of Technology, Beijing
来源：
Zidonghua Xuebao/Acta Automatica Sinica | 2021年 / 47卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Ant colony optimization; Brain effective connectivity network; Heuristic function revision; Multiple source information fusion; Search space compression;
D O I：
10.16383/j.aas.c180680
中图分类号：
学科分类号：
摘要：
The research of brain effective connectivity (EC) networks is an important topic within the community of human brain connectome, where identifying brain EC networks from neuroimaging data has become an effective tool which can evaluate normal brain functions and their injuries associated with neurodegenerative diseases. For learning brain EC networks from functional magnetic resonance imaging data, this paper proposes an ant colony optimization algorithm merged with multiple source information, called ACOMM-EC. First, the new algorithm employs diffusion tensor imaging data to acquire anatomical constraint information among regions of interest (ROIs), and uses Pearson positive correlated information to restrict the search spaces of feasible solutions so that many unnecessary searches of ants can be avoided. And then, by combining the joint active information between two nodes of an arc and the original heuristic function, a new heuristic function with a better heuristic ability is given to induct the process of stochastic searches, which enhances the purpose of ants searching, and improves the optimization efficiency. Finally, the algorithm is tested on different data and compared with some recently proposed algorithms. The results show that the two strategies are effective, and the solution quality of the new algorithm precedes the other algorithms while the convergence speed is faster. Copyright © 2021 Acta Automatica Sinica. All rights reserved.
引用
收藏
页码：864 / 881
页数：17
相关论文
共 40 条
  • [11] Xu L, Fan T, Wu X, Et al., A pooling-LiNGAM algorithm for effective connectivity analysis of fMRI data, Frontiers in Computational Neuroscience, 8, (2014)
  • [12] Shimizu S, Hoyer P O, Hyvarinen A, Et al., A linear non-Gaussian acyclic model for causal discovery, Journal of Machine Learning Research, 7, Oct, pp. 2003-2030, (2006)
  • [13] Shimizu S, Kano Y., Use of non-normality in structural equation modeling: Application to direction of causation, Journal of Statistical Planning and Inference, 138, 11, pp. 3483-3491, (2008)
  • [14] Quiroga R Q, Kraskov A, Kreuz T, Et al., Performance of different synchronization measures in real data: A case study on electroencephalographic signals, Physical Review E, 65, 4, (2002)
  • [15] Dauwels J, Vialatte F, Musha T, Et al., A comparative study of synchrony measures for the early diagnosis of Alzheimer's disease based on EEG, NeuroImage, 49, 1, pp. 668-693, (2010)
  • [16] Patel R S, Bowman F D B, Rilling J K., A Bayesian approach to determining connectivity of the human brain, Human Brain Mapping, 27, 3, pp. 267-276, (2006)
  • [17] Ide J S, Zhang S, Chiang-shan R L., Bayesian network models in brain functional connectivity analysis, International Journal of Approximate Reasoning, 55, 1, pp. 23-35, (2014)
  • [18] Mumford J A, Ramsey J D., Bayesian networks for fMRI: a primer, Neuroimage, 86, pp. 573-582, (2014)
  • [19] Meek C., Causal inference and causal explanation with background knowledge, Proceedings of the Eleventh conference on Uncertainty in artificial intelligence (UAI-95), pp. 403-410, (1995)
  • [20] Richardson T, Spirtes P., Automated discovery of linear feedback models, (1996)
1234