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

链路预测:一种图形模型方法

Link Prediction: A Graphical Model Approach

Daniele Alpago, Mattia Zorzi, Augusto Ferrante

摘要:

我们考虑的问题,在网络的边缘结构可能会随着时间的推移而变化(足够慢)的链接预测。这个问题在包括社交网络在内的许多重要领域都有应用,它有两个主要变体:第一个变体称为正链接预测或PLP,它包括估计网络中链接的外观。第二种方法,称为负链接预测或NLP,包括估计网络中链接的消失。我们提出了一种数据驱动的方法来估计边缘的出现/消失。我们的解决方案是基于一个正规化的最优化问题,我们证明了存在性和唯一性的最优解。

英文摘要:

We consider the problem of link prediction in networks whose edge structure may vary (sufficiently slowly) over time. This problem, with applications in many important areas including social networks, has two main variants: the first, known as positive link prediction or PLP consists in estimating the appearance of a link in the network. The second, known as negative link prediction or NLP consists in estimating the disappearance of a link in the network. We propose a data-driven approach to estimate the appearance/disappearance of edges. Our solution is based on a regularized optimization problem for which we prove existence and uniqueness of the optimal solution.

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

↑