arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.14187math.OC
收藏

基于图模型的数据驱动链路预测

Data-driven Link Prediction over Graphical Models

Daniele Alpago, Mattia Zorzi, Augusto Ferrante

摘要:

正链接预测(PLP)问题制定在一个系统辨识框架:我们考虑动态图形模型的自回归移动平均(ARMA)高斯随机过程。对于参数的识别,我们在两个不同的时间尺度上对我们的网络进行建模:一个更快的时间尺度,我们假设代表代理动态的过程可以被认为是静止的,另一个更慢的时间尺度,模型参数可能会发生变化。后者解释了新边缘的可能出现。识别问题被投到一个优化框架,可以看作是一个推广的ARMA图形模型识别的现有方法。我们证明了这样一个最优化问题的解的存在性和唯一性,并提出了一个数值计算此解的程序。仿真测试我们的方法的性能。

英文摘要:

The positive link prediction (PLP) problem is formulated in a system identification framework: we consider dynamic graphical models for auto-regressive moving-average (ARMA) Gaussian random processes. For the identification of the parameters, we model our network on two different time scales: a quicker one, over which we assume that the process representing the dynamics of the agents can be considered to be stationary, and a slower one in which the model parameters may vary. The latter accounts for the possible appearance of new edges. The identification problem is cast into an optimization framework which can be seen as a generalization of the existing methods for the identification of ARMA graphical models. We prove the existence and uniqueness of the solution of such an optimization problem and we propose a procedure to compute numerically this solution. Simulations testing the performances of our method are provided.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑