arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.06783cs.LGcs.AIcs.SI
收藏

NPGLM:一种用于时间链接预测的非参数方法

NPGLM: A Non-Parametric Method for Temporal Link Prediction

Sharif University of Technology(谢里夫理工大学);University of Illinois at Chicago(伊利诺伊大学芝加哥分校)

Sina Sajadmanesh, Jiawei Zhang, Hamid R. Rabiee

摘要:

本文试图解决信息网络中的时间链接预测问题。这意味着预测链接在未来出现所需的时间,给定其在当前网络快照中提取的特征。为此,我们引入了一种概率非参数的方法,称为“非参数广义线性模型”(NP-GLM),它推断出隐藏的潜在概率分布的链路出现时间给定的功能。然后,我们提出了一个学习算法的NP-GLM和推理方法来回答时间相关的查询。在合成数据和真实新浪微博社交网络上进行的大量实验证明了NP-GLM在解决时间链接预测问题时的有效性。

英文摘要:

In this paper, we try to solve the problem of temporal link prediction in information networks. This implies predicting the time it takes for a link to appear in the future, given its features that have been extracted at the current network snapshot. To this end, we introduce a probabilistic non-parametric approach, called "Non-Parametric Generalized Linear Model" (NP-GLM), which infers the hidden underlying probability distribution of the link advent time given its features. We then present a learning algorithm for NP-GLM and an inference method to answer time-related queries. Extensive experiments conducted on both synthetic data and real-world Sina Weibo social network demonstrate the effectiveness of NP-GLM in solving temporal link prediction problem vis-a-vis competitive baselines.

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

↑