Structural Importance-based Link Prediction Techniques in Social Network

Q2 Engineering
A. Samad, Muhammad Azam, Mamoona Qadir
{"title":"Structural Importance-based Link Prediction Techniques in Social Network","authors":"A. Samad, Muhammad Azam, Mamoona Qadir","doi":"10.4108/eai.7-1-2021.167840","DOIUrl":null,"url":null,"abstract":"Link prediction in social network gaining high attention of researchers nowadays due to the rush of users towards social network. Link prediction is known as the prediction of missing or unobserved link, i.e., new interaction is going to be occurring in a near future. State-of-the-art link prediction techniques(e.g., Jaccard Index, Resource Allocation, SAM Similarity, Sorensen Index, Salton Cosine, Hub Depressed Index and Parameter-Dependent) considers only similarity of the pair of node in order to find the link. However, we argued that nodes having same status of centralization along with high similarity can connect to each other in a future. In this paper, we have proposed structural importance-based state-of-the-art link prediction techniques and compared. We have compared structural importance-based link prediction techniques with state-of-the-art techniques. The experiments are performed on four di ff erent datasets (i.e., Astro, CondMat, HepPh and HepTh). Our results show that structural importance-based link prediction techniques outperformed than state-of-the-art link prediction techniques by getting 95% at threshold 0.1 and 68% at threshold 0.7.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/eai.7-1-2021.167840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 2

Abstract

Link prediction in social network gaining high attention of researchers nowadays due to the rush of users towards social network. Link prediction is known as the prediction of missing or unobserved link, i.e., new interaction is going to be occurring in a near future. State-of-the-art link prediction techniques(e.g., Jaccard Index, Resource Allocation, SAM Similarity, Sorensen Index, Salton Cosine, Hub Depressed Index and Parameter-Dependent) considers only similarity of the pair of node in order to find the link. However, we argued that nodes having same status of centralization along with high similarity can connect to each other in a future. In this paper, we have proposed structural importance-based state-of-the-art link prediction techniques and compared. We have compared structural importance-based link prediction techniques with state-of-the-art techniques. The experiments are performed on four di ff erent datasets (i.e., Astro, CondMat, HepPh and HepTh). Our results show that structural importance-based link prediction techniques outperformed than state-of-the-art link prediction techniques by getting 95% at threshold 0.1 and 68% at threshold 0.7.
基于结构重要性的社交网络链接预测技术
由于用户对社交网络的涌入,社交网络中的链接预测受到了研究者的高度关注。链接预测被称为对缺失或未观察到的链接的预测,也就是说,新的交互将在不久的将来发生。最先进的链路预测技术(例如:如Jaccard Index、Resource Allocation、SAM Similarity、Sorensen Index、Salton Cosine、Hub Depressed Index和Parameter-Dependent等,它们只考虑节点对的相似性来寻找链接。然而,我们认为具有相同集中化状态和高相似性的节点可以在未来相互连接。在本文中,我们提出了基于结构重要性的最先进的链路预测技术,并进行了比较。我们比较了基于结构重要性的链接预测技术和最先进的技术。实验在四个不同的数据集上进行(即Astro, CondMat, HepPh和HepTh)。我们的研究结果表明,基于结构重要性的链路预测技术优于最先进的链路预测技术,在阈值0.1和阈值0.7分别获得95%和68%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.00
自引率
0.00%
发文量
15
审稿时长
10 weeks
×
引用
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学术官方微信