Relationships between network's structure features and link prediction algorithms

J. Jun, Hu Xiao-feng
{"title":"Relationships between network's structure features and link prediction algorithms","authors":"J. Jun, Hu Xiao-feng","doi":"10.1109/INFOMAN.2016.7477535","DOIUrl":null,"url":null,"abstract":"The first essential thing on the application of link prediction is how to choose the right prediction algorithm. We experimented with five virtual networks and analyzed the relationship between those networks' structure features and six typical link prediction algorithms by the experiment's data in this paper. We found that if the network's assortativity coefficient is positive and the clustering coefficient is greater than the threshold which is about 0.1, the algorithms based on local information would get higher prediction results, otherwise the based global information would be better. And the clustering coefficient and efficiency are proportional to the accuracy of algorithms based local information and are reverse proportional to the algorithms based global information. These conclusions provide the quantitative basis for selecting the right algorithms in link prediction application.","PeriodicalId":182252,"journal":{"name":"2016 2nd International Conference on Information Management (ICIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Information Management (ICIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOMAN.2016.7477535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The first essential thing on the application of link prediction is how to choose the right prediction algorithm. We experimented with five virtual networks and analyzed the relationship between those networks' structure features and six typical link prediction algorithms by the experiment's data in this paper. We found that if the network's assortativity coefficient is positive and the clustering coefficient is greater than the threshold which is about 0.1, the algorithms based on local information would get higher prediction results, otherwise the based global information would be better. And the clustering coefficient and efficiency are proportional to the accuracy of algorithms based local information and are reverse proportional to the algorithms based global information. These conclusions provide the quantitative basis for selecting the right algorithms in link prediction application.
网络结构特征与链路预测算法之间的关系
在链路预测应用中,首先要解决的问题是如何选择正确的预测算法。本文对五种虚拟网络进行了实验,并利用实验数据分析了这些网络的结构特征与六种典型的链路预测算法之间的关系。我们发现,当网络的分类系数为正且聚类系数大于阈值(约0.1)时,基于局部信息的算法会获得更高的预测结果,否则基于全局信息的算法会获得更好的预测结果。聚类系数和效率与基于局部信息的聚类算法的准确率成正比,与基于全局信息的聚类算法的准确率成反比。这些结论为在链路预测应用中选择合适的算法提供了定量依据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信