首页> 美国卫生研究院文献>Scientific Reports >Similarity-based future common neighbors model for link prediction in complex networks
【2h】

Similarity-based future common neighbors model for link prediction in complex networks

机译:复杂网络中基于相似度的未来共同邻居模型的链路预测

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Link prediction aims to predict the existence of unknown links via the network information. However, most similarity-based algorithms only utilize the current common neighbor information and cannot get high enough prediction accuracy in evolving networks. So this paper firstly defines the future common neighbors that can turn into the common neighbors in the future. To analyse whether the future common neighbors contribute to the current link prediction, we propose the similarity-based future common neighbors (SFCN) model for link prediction, which accurately locate all the future common neighbors besides the current common neighbors in networks and effectively measure their contributions. We also design and observe three MATLAB simulation experiments. The first experiment, which adjusts two parameter weights in the SFCN model, reveals that the future common neighbors make more contributions than the current common neighbors in complex networks. And two more experiments, which compares the SFCN model with eight algorithms in five networks, demonstrate that the SFCN model has higher accuracy and better performance robustness.
机译:链接预测旨在通过网络信息来预测未知链接的存在。但是,大多数基于相似度的算法仅利用当前的公共邻居信息,并且在演进的网络中无法获得足够高的预测精度。因此,本文首先定义了将来可以成为共同邻居的未来共同邻居。为了分析未来的公共邻居是否对当前的链路预测有所帮助,我们提出了基于相似度的未来公共邻居(SFCN)模型进行链路预测,该模型可以准确定位网络中当前公共邻居之外的所有未来的公共邻居,并有效地测量其未来。贡献。我们还设计并观察了三个MATLAB仿真实验。在SFCN模型中调整两个参数权重的第一个实验表明,在复杂网络中,未来的公共邻居比当前的公共邻居做出了更大的贡献。另有两个实验将SFCN模型与五个网络中的八种算法进行了比较,证明SFCN模型具有更高的准确性和更好的性能鲁棒性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号