首页> 外文会议>International Symposium on Computational Intelligence and Design;ISCID 2012 >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.
机译:最近,人们对研究复杂网络中的对象之间的链接越来越感兴趣,这对许多数据挖掘任务很有帮助。对象之间的链接的基础研究之一是链接预测。已经提出了许多链路预测算法,并且它们表现良好,但是,这些算法中的大多数仅就传统图论而言仅涉及网络结构,而传统图论缺乏有关演进网络的信息。本文提出了一种新颖的基于张量的预测方法,该方法通过两个步骤进行设计:首先,使用指数平滑方法在形成多向张量的邻接矩阵中跟踪时间相关的网络快照。其次,应用Common Neighbor算法来计算每个节点的相似度。该算法与其他基于张量的算法也有很大不同,本文也提到了其他算法。为了评估我们的链接预测算法的准确性,我们使用了各种流行的社交网络和信息平台数据集,例如Facebook和Wikipedia网络。结果表明,我们的链接预测算法的性能优于本文提到的另一种基于张量的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号