An Improved Link Prediction Algorithm of Complex Network

Xinru Wang, Zhiguo Hong, Minyong Shi
{"title":"An Improved Link Prediction Algorithm of Complex Network","authors":"Xinru Wang, Zhiguo Hong, Minyong Shi","doi":"10.1109/ICCST50977.2020.00042","DOIUrl":null,"url":null,"abstract":"In recent years, link prediction has become a hot spot in complex network research area. Its goal is to calculate the possibility of future connection between the currently unconnected nodes through the known topology and other information in the network. At present, most prediction algorithms are based on local similarity and focus on the common neighbors and degree of nodes without considering the impact of compactness between nodes on the prediction. For this reason, in this paper an improved link prediction algorithm, named as CCRA(Resource Allocation with Clustering Coefficient) is proposed by combining the local similarity property with clustering coefficient. Furthermore, the accuracy of this algorithm's prediction is verified through experiments on real data sets. Consequently, conclusion on this algorithm is derived thereby.","PeriodicalId":189809,"journal":{"name":"2020 International Conference on Culture-oriented Science & Technology (ICCST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Culture-oriented Science & Technology (ICCST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCST50977.2020.00042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, link prediction has become a hot spot in complex network research area. Its goal is to calculate the possibility of future connection between the currently unconnected nodes through the known topology and other information in the network. At present, most prediction algorithms are based on local similarity and focus on the common neighbors and degree of nodes without considering the impact of compactness between nodes on the prediction. For this reason, in this paper an improved link prediction algorithm, named as CCRA(Resource Allocation with Clustering Coefficient) is proposed by combining the local similarity property with clustering coefficient. Furthermore, the accuracy of this algorithm's prediction is verified through experiments on real data sets. Consequently, conclusion on this algorithm is derived thereby.
一种改进的复杂网络链路预测算法
近年来,链路预测已成为复杂网络研究领域的一个热点。其目标是通过网络中已知的拓扑和其他信息,计算当前未连接节点之间未来连接的可能性。目前,大多数预测算法都是基于局部相似度,关注节点的共同近邻和程度,而没有考虑节点之间的紧密度对预测的影响。为此,本文将局部相似性与聚类系数相结合,提出了一种改进的链路预测算法CCRA(Resource Allocation with Clustering Coefficient)。最后,通过在真实数据集上的实验,验证了该算法预测的准确性。从而得出了该算法的结论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信