首页> 外文会议>International Symposium on Computational Intelligence and Design >Link Prediction on Evolving Data Using Tensor-Based Common Neighbor
【24h】

Link Prediction on Evolving Data Using Tensor-Based Common Neighbor

机译:基于张量的常见邻居演化数据的链路预测

获取原文

摘要

Recently there has been increasingly interest in researching links between objects in complex networks, which can be helpful in many data mining tasks. One of the fundamental researches of links between objects is link prediction. Many link prediction algorithms have been proposed and perform quite well, however, most of those algorithms only concerns network structure in terms of traditional graph theory, which lack information about evolving network. in this paper we proposed a novel tensor-based prediction method, which is designed through two steps: First, tracking time-dependent network snapshots in adjacency matrices which form a multi-way tensor by using exponential smoothing method. Second, apply Common Neighbor algorithm to compute the degree of similarity for each nodes. This algorithm is quite different from other tensor-based algorithms, which also mentioned in this paper. in order to estimate the accuracy of our link prediction algorithm, we employ various popular datasets of social networks and information platforms, such as Facebook and Wikipedia networks. the results show that our link prediction algorithm performances better than another tensor-based algorithms mentioned in this paper.
机译:最近,对复杂网络中对象之间的链接越来越感兴趣,这可能有助于许多数据挖掘任务。对象之间的链接的基本研究之一是链路预测。已经提出了许多链路预测算法并表现得很好,然而,这些算法中的大多数缺乏传统图论的网络结构缺乏关于不断发展网络的信息。在本文中,我们提出了一种新的张量的预测方法,它通过两个步骤设计:首先,通过使用指数平滑方法跟踪邻接矩阵中的时间依赖网络快照,其形成多向扭矩。其次,应用公共邻居算法来计算每个节点的相似度。该算法与其他张量的算法完全不同,本文还提到。为了估计我们的链接预测算法的准确性,我们聘请了社交网络和信息平台的各种流行的数据集,例如Facebook和维基百科网络。结果表明,我们的链路预测算法表现优于本文提到的另一个基于卷的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号