arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.2871cs.SIphysics.soc-ph
收藏

在线社交网络中的亲和度预测

Affinity Prediction in Online Social Networks

Matias Estrada, Marcelo Mendoza

摘要:

链接预测是推断图中的顶点对之间的潜在边在不久的将来是否存在的问题。为了执行该任务,通常使用由多个可用的和观察到的顶点/边提供的信息。然后,可以创建基于此信息的许多边缘评分方法。通常,这些方法评估所观察到的图的局部结构,假设在原始观察期内更接近的顶点将更有可能在未来形成链接。在本文中,我们探讨了本地和全球的功能相结合,进行在线社交网络的链接预测。本文的贡献是双重的:a)我们评估了一些策略,结合全球和本地功能解决局部假设的链接预测评分方法,和b)我们只使用网络拓扑为基础的功能,避免包括信息或交易为基础的功能,涉及沉重的计算成本的方法。我们使用Skout Inc.提供的真实数据评估我们的提案,一个在全球拥有数百万用户的亲密在线社交网络。我们的结果表明,我们的建议是可行的。

英文摘要:

Link prediction is the problem of inferring whether potential edges between pairs of vertices in a graph will be present or absent in the near future. To perform this task it is usual to use information provided by a number of available and observed vertices/edges. Then, a number of edge scoring methods based on this information can be created. Usually, these methods assess local structures of the observed graph, assuming that closer vertices in the original period of observation will be more likely to form a link in the future. In this paper we explore the combination of local and global features to conduct link prediction in online social networks. The contributions of the paper are twofold: a) We evaluate a number of strategies that combines global and local features tackling the locality assumption of link prediction scoring methods, and b) We only use network topology-based features, avoiding the inclusion of informational or transactional based features that involve heavy computational costs in the methods. We evaluate our proposal using real-world data provided by Skout Inc., an affinity online social network with millions of users around the world. Our results show that our proposal is feasible.

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

↑