Link Prediction in Social Networks Using Proximity-Based Algorithms

Aparna P M, Jayalaxmi G N, V. Baligar
{"title":"Link Prediction in Social Networks Using Proximity-Based Algorithms","authors":"Aparna P M, Jayalaxmi G N, V. Baligar","doi":"10.1109/ICERECT56837.2022.10060562","DOIUrl":null,"url":null,"abstract":"There has been an overwhelming increase in social media users in today's world. This ever-increasing data of the Social Network poses a challenge for Link Prediction analysis. The association between users that is not present but has a possibility of existing in the future can be predicted by Link Prediction techniques. In Social Networks, Link Prediction can be employed to monitor social interactions & anomalies, suggest friends to the users and also to analyze the influence or detect communities. Link Prediction helps in retaining the users for longer duration and hence there is a boost in the engagement rate. The more accurate the link prediction is the higher the engagement rate of the applications. Social Networks like Facebook, E-business organisations Zomato and Amazon employ Link Prediction in various forms to boost their revenue and user-experience. There are various algorithms that help in calculation of the possibility of link between entities. The algorithm selection will be based on the specific use case requirement of the applications. The authors of this paper discuss Jaccard Coefficient and Resource Allocation Proximity-based algorithms for Link Prediction. The comparative study is conducted for each of the algorithms and it is observed that the combination of both the algorithms yields a better result than either of them.","PeriodicalId":205485,"journal":{"name":"2022 Fourth International Conference on Emerging Research in Electronics, Computer Science and Technology (ICERECT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Fourth International Conference on Emerging Research in Electronics, Computer Science and Technology (ICERECT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICERECT56837.2022.10060562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

There has been an overwhelming increase in social media users in today's world. This ever-increasing data of the Social Network poses a challenge for Link Prediction analysis. The association between users that is not present but has a possibility of existing in the future can be predicted by Link Prediction techniques. In Social Networks, Link Prediction can be employed to monitor social interactions & anomalies, suggest friends to the users and also to analyze the influence or detect communities. Link Prediction helps in retaining the users for longer duration and hence there is a boost in the engagement rate. The more accurate the link prediction is the higher the engagement rate of the applications. Social Networks like Facebook, E-business organisations Zomato and Amazon employ Link Prediction in various forms to boost their revenue and user-experience. There are various algorithms that help in calculation of the possibility of link between entities. The algorithm selection will be based on the specific use case requirement of the applications. The authors of this paper discuss Jaccard Coefficient and Resource Allocation Proximity-based algorithms for Link Prediction. The comparative study is conducted for each of the algorithms and it is observed that the combination of both the algorithms yields a better result than either of them.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于邻近算法的社交网络链接预测
当今世界,社交媒体用户的数量出现了压倒性的增长。不断增长的社交网络数据对链接预测分析提出了挑战。用户之间不存在但将来有可能存在的关联可以通过链接预测技术来预测。在社交网络中,链接预测可以用来监测社交互动和异常,向用户推荐朋友,也可以用来分析影响或检测社区。链接预测有助于延长用户留存时间,从而提高用户粘性。链接预测越准确,应用程序的参与度就越高。像Facebook这样的社交网络、电子商务组织Zomato和亚马逊都采用了各种形式的链接预测来提高他们的收入和用户体验。有各种各样的算法可以帮助计算实体之间链接的可能性。算法的选择将基于应用程序的特定用例需求。本文讨论了基于Jaccard系数和资源分配邻近度的链路预测算法。对每一种算法进行了比较研究,观察到两种算法的组合效果优于任何一种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research of Computer Simulation based on Digital Design in the Design Application A Novel Study on EVs Smart Charging Optimization Modelling of Eye Blink Monitoring Mechanism utilizing ML Techniques Performance Evaluation of a Network on Chip Based on Ghz Throughput and Low Power for Streaming Data Transmission on FPGA Way Forward to Digital Society – Digital Transformation of Msmes from Industry 4.0 to Industry 5.0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1