A novel particle swarm optimization-based intelligence link prediction algorithm in real world networks

Deepjyoti Choudhury, T. Acharjee
{"title":"A novel particle swarm optimization-based intelligence link prediction algorithm in real world networks","authors":"Deepjyoti Choudhury, T. Acharjee","doi":"10.11591/eei.v13i3.6761","DOIUrl":null,"url":null,"abstract":"Link prediction in social network is an important topic due to its applications like finding collaborations and recommending friends. Among existing link prediction methods, similarity-based approaches are found to be most effective since they examine the number of common neighbours (CN). Current work presents a novel link prediction algorithm based on particle swarm optimization (PSO) and implemented on four real world datasets namely, Zachary’s karate club (ZKC), bottlenose dolphin network (BDN), college football network (CFN) and Krebs’ books on American politics (KBAP). It consists of three experiments: i) to find the measures on existing methods and compare them with our proposed algorithm; ii) to find the measured values of the existing methods along with our proposed one to determine future links among nodes that have no CN; and iii) to find the measures of the methods to determine future links among nodes having same number of CN. In experiment 1, our proposed approach achieved 75.88%, 78.34%, 82.63% and 78.36% accuracy for ZKC, BDN, CFN, and KBAP respectively. These results beat the performances of traditional algorithms. In experiment 2, the accuracies are found as 75.53%, 74.25%, 81.63% and 78.34% respectively. In experiment 3, accuracies are detected as 72.75%, 81.53%, 78.35% and 75.13% respectively.","PeriodicalId":502860,"journal":{"name":"Bulletin of Electrical Engineering and Informatics","volume":"16 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Electrical Engineering and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/eei.v13i3.6761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Link prediction in social network is an important topic due to its applications like finding collaborations and recommending friends. Among existing link prediction methods, similarity-based approaches are found to be most effective since they examine the number of common neighbours (CN). Current work presents a novel link prediction algorithm based on particle swarm optimization (PSO) and implemented on four real world datasets namely, Zachary’s karate club (ZKC), bottlenose dolphin network (BDN), college football network (CFN) and Krebs’ books on American politics (KBAP). It consists of three experiments: i) to find the measures on existing methods and compare them with our proposed algorithm; ii) to find the measured values of the existing methods along with our proposed one to determine future links among nodes that have no CN; and iii) to find the measures of the methods to determine future links among nodes having same number of CN. In experiment 1, our proposed approach achieved 75.88%, 78.34%, 82.63% and 78.36% accuracy for ZKC, BDN, CFN, and KBAP respectively. These results beat the performances of traditional algorithms. In experiment 2, the accuracies are found as 75.53%, 74.25%, 81.63% and 78.34% respectively. In experiment 3, accuracies are detected as 72.75%, 81.53%, 78.35% and 75.13% respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
真实世界网络中基于粒子群优化的新型智能链路预测算法
社交网络中的链接预测是一个重要的课题,因为它具有寻找合作和推荐好友等应用价值。在现有的链接预测方法中,基于相似性的方法被认为是最有效的,因为它们会检查共同邻域(CN)的数量。目前的研究提出了一种基于粒子群优化(PSO)的新型链接预测算法,并在四个真实世界的数据集(即 Zachary 的空手道俱乐部(ZKC)、瓶鼻海豚网络(BDN)、大学足球网络(CFN)和 Krebs 的美国政治书籍(KBAP))上实施。它包括三个实验:i) 寻找现有方法的测量值,并与我们提出的算法进行比较;ii) 寻找现有方法和我们提出的方法的测量值,以确定没有 CN 的节点之间的未来链接;iii) 寻找方法的测量值,以确定具有相同数量 CN 的节点之间的未来链接。在实验 1 中,我们提出的方法对 ZKC、BDN、CFN 和 KBAP 的准确率分别达到了 75.88%、78.34%、82.63% 和 78.36%。这些结果优于传统算法。在实验 2 中,准确率分别为 75.53%、74.25%、81.63% 和 78.34%。在实验 3 中,检测准确率分别为 72.75%、81.53%、78.35% 和 75.13%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cross-project software defect prediction through multiple learning Palembang songket fabric motif image detection with data augmentation based on ResNet using dropout Secure map-based crypto-stego technique based on mac address Low insertion loss open-loop resonator–based microstrip diplexer with high selective for wireless applications Autonomous vehicle tracking control for a curved trajectory
×
引用
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