Complex networks identification using Bayesian model with independent Laplace prior

被引:11
作者
Zhang, Yichi [1 ]
Li, Yonggang [1 ]
Deng, Wenfeng [1 ]
Huang, Keke [1 ]
Yang, Chunhua [1 ]
机构
[1] Cent South Univ, Sch Automat, Changsha 410083, Peoples R China
基金
中国国家自然科学基金;
关键词
COMMUNICATION; REGRESSION; COMMUNITY; SELECTION;
D O I
10.1063/5.0031134
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Identification of complex networks from limited and noise contaminated data is an important yet challenging task, which has attracted researchers from different disciplines recently. In this paper, the underlying feature of a complex network identification problem was analyzed and translated into a sparse linear programming problem. Then, a general framework based on the Bayesian model with independent Laplace prior was proposed to guarantee the sparseness and accuracy of identification results after analyzing influences of different prior distributions. At the same time, a three-stage hierarchical method was designed to resolve the puzzle that the Laplace distribution is not conjugated to the normal distribution. Last, the variational Bayesian was introduced to improve the efficiency of the network reconstruction task. The high accuracy and robust properties of the proposed method were verified by conducting both general synthetic network and real network identification tasks based on the evolutionary game dynamic. Compared with other five classical algorithms, the numerical experiments indicate that the proposed model can outperform these methods in both accuracy and robustness.
引用
收藏
页数:17
相关论文
共 57 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]   Regularization of wavelet approximations - Rejoinder [J].
Antoniadis, A ;
Fan, J .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2001, 96 (455) :964-967
[3]   Gene selection using a two-level hierarchical Bayesian model [J].
Bae, K ;
Mallick, BK .
BIOINFORMATICS, 2004, 20 (18) :3423-3430
[4]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[5]  
BealMJ, 2003, Variational algorithms for approximate Bayesian inference
[6]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[7]   Variance-Constrained State Estimation for Complex Networks With Randomly Varying Topologies [J].
Dong, Hongli ;
Hou, Nan ;
Wang, Zidong ;
Ren, Weijian .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (07) :2757-2768
[8]   Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit [J].
Donoho, David L. ;
Tsaig, Yaakov ;
Drori, Iddo ;
Starck, Jean-Luc .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (02) :1094-1121
[9]  
Faul A. C., 2001, INT C NEUR INF PROC
[10]   Adaptive sparseness for supervised learning [J].
Figueiredo, MAT .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (09) :1150-1159