An improved link prediction algorithm based on degrees and similarities of nodes

Qingshuang Sun, Rongjing Hu, Zhao Yang, Yabing Yao, F. Yang
{"title":"An improved link prediction algorithm based on degrees and similarities of nodes","authors":"Qingshuang Sun, Rongjing Hu, Zhao Yang, Yabing Yao, F. Yang","doi":"10.1109/ICIS.2017.7959962","DOIUrl":null,"url":null,"abstract":"Link prediction is to calculate the probability of a potential link between a pair of unlinked nodes in the future. It has significance value in both theoretical and practical. The similarity of two nodes in the networks is an essential factor to determine the probability of a potential link between them. One of the important methods with the similarity of two nodes is to consider common neighbors of two nodes. However, the number of common neighbors only describes a kind of quantitative relationship without taking into account the topology of given networks and the information of local structure which consist of a pair of nodes and their common neighbors. Therefore, we introduce the concept of the degrees of nodes and the idea of community structure and propose a new similarity index, namely, local affinity structure(LAS). The LAS method describes the closeness of a pair of nodes and their common neighbors. We evaluated LAS on twelve different networks compared with other three similarity based indexes which consider the degree of nodes. From the experimental results, our method shows obvious superiority in improving the accuracy of link prediction.","PeriodicalId":301467,"journal":{"name":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2017.7959962","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Link prediction is to calculate the probability of a potential link between a pair of unlinked nodes in the future. It has significance value in both theoretical and practical. The similarity of two nodes in the networks is an essential factor to determine the probability of a potential link between them. One of the important methods with the similarity of two nodes is to consider common neighbors of two nodes. However, the number of common neighbors only describes a kind of quantitative relationship without taking into account the topology of given networks and the information of local structure which consist of a pair of nodes and their common neighbors. Therefore, we introduce the concept of the degrees of nodes and the idea of community structure and propose a new similarity index, namely, local affinity structure(LAS). The LAS method describes the closeness of a pair of nodes and their common neighbors. We evaluated LAS on twelve different networks compared with other three similarity based indexes which consider the degree of nodes. From the experimental results, our method shows obvious superiority in improving the accuracy of link prediction.
一种改进的基于节点度和相似度的链路预测算法
链路预测是计算未来一对未连接节点之间潜在链路的概率。具有重要的理论和实践价值。网络中两个节点的相似性是决定它们之间潜在连接概率的重要因素。考虑两个节点的共同邻居是处理两个节点相似度的重要方法之一。然而,共同邻居的数量只是描述了一种定量关系,而没有考虑到给定网络的拓扑结构和由一对节点及其共同邻居组成的局部结构的信息。为此,我们引入节点度的概念和群落结构的思想,提出了一种新的相似度指标,即局部亲和结构(local affinity structure, LAS)。LAS方法描述了一对节点及其共同邻居的接近程度。我们在12种不同的网络上对LAS进行了评估,并与考虑节点度的其他三种基于相似性的指标进行了比较。实验结果表明,该方法在提高链路预测精度方面具有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信