部分可观测性下拓扑推断的无偏对称矩阵估计
An Unbiased Symmetric Matrix Estimator for Topology Inference under Partial Observability
摘要:
网络拓扑推断是网络科学许多应用中的一个基本问题,例如定位假新闻的来源,大脑连接网络检测等。许多现实世界的情况下,只有有限的一部分观察到的节点是可用的。本文在部分能观性框架下研究了网络拓扑推断问题。基于向量自回归模型,提出了一种新的具有高斯噪声和拉普拉斯组合规则的对称网络拓扑结构的无偏估计量。理论上证明了它依概率收敛于网络组合矩阵。在此基础上,利用高斯混合模型算法,提出了一种有效的网络推理高斯算法。最后,通过数值实验与现有方法进行了比较,结果表明该算法在小样本量的情况下具有更好的性能。
英文摘要:
Network topology inference is a fundamental problem in many applications of network science, such as locating the source of fake news, brain connectivity networks detection, etc. Many real-world situations suffer from a critical problem that only a limited part of observed nodes are available. This letter considers the problem of network topology inference under the framework of partial observability. Based on the vector autoregressive model, we propose a novel unbiased estimator for the symmetric network topology with the Gaussian noise and the Laplacian combination rule. Theoretically, we prove that it converges to the network combination matrix in probability. Furthermore, by utilizing the Gaussian mixture model algorithm, an effective algorithm called network inference Gauss algorithm is developed to infer the network structure. Finally, compared with the state-of-the-art methods, numerical experiments demonstrate the proposed algorithm enjoys better performance in the case of small sample sizes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。