Providing a new method for link prediction in social networks based on the meta-heuristic algorithm

Amin Rezaeipanah, M. Mokhtari, Milad Boshkani Zadeh
{"title":"Providing a new method for link prediction in social networks based on the meta-heuristic algorithm","authors":"Amin Rezaeipanah, M. Mokhtari, Milad Boshkani Zadeh","doi":"10.33545/27075907.2020.v1.i1a.6","DOIUrl":null,"url":null,"abstract":"Social network analysis is one of the most important research fields in data mining today. The purpose of the analysis of these networks is to extract the embedded knowledge in the data set and to learn the behavior of users in the social networking environment. One of the most attractive and central applications of social network analysis is link prediction. The purpose of link prediction in social networks is to identify missing and unknown information from users or to predict the future link between two users. In recent years, various artificial intelligence algorithms have been introduced as one of the most important tools for resolving link prediction and big data. In this research, a strategy based on a meta-heuristic is used to improve link prediction in social networks. The proposed method is based on the characteristics of the signed social networks provided and turns the link prediction problem into a two-class classification problem. Then uses the capability of the Particle Swarm Optimization (PSO) and the topological properties of the social network graph to create a database with two classes, the first class pointing to the existence of a connection between the users and the second class pointing to the absence of this relationship. Creates a database using the support vector machine model for categorization work and uses the classic Katz similarity criterion for end-user suggestions. Twitter social network information has been used to compare and evaluate the proposed method. The results of the experiments show the superiority of the proposed method with 0.23, 0.99, and 6.32, respectively, compared to Meta-Path, Katz and CN algorithms in F-measure criterion.","PeriodicalId":170946,"journal":{"name":"International Journal of Cloud Computing and Database Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Cloud Computing and Database Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33545/27075907.2020.v1.i1a.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Social network analysis is one of the most important research fields in data mining today. The purpose of the analysis of these networks is to extract the embedded knowledge in the data set and to learn the behavior of users in the social networking environment. One of the most attractive and central applications of social network analysis is link prediction. The purpose of link prediction in social networks is to identify missing and unknown information from users or to predict the future link between two users. In recent years, various artificial intelligence algorithms have been introduced as one of the most important tools for resolving link prediction and big data. In this research, a strategy based on a meta-heuristic is used to improve link prediction in social networks. The proposed method is based on the characteristics of the signed social networks provided and turns the link prediction problem into a two-class classification problem. Then uses the capability of the Particle Swarm Optimization (PSO) and the topological properties of the social network graph to create a database with two classes, the first class pointing to the existence of a connection between the users and the second class pointing to the absence of this relationship. Creates a database using the support vector machine model for categorization work and uses the classic Katz similarity criterion for end-user suggestions. Twitter social network information has been used to compare and evaluate the proposed method. The results of the experiments show the superiority of the proposed method with 0.23, 0.99, and 6.32, respectively, compared to Meta-Path, Katz and CN algorithms in F-measure criterion.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
提出了一种基于元启发式算法的社交网络链接预测新方法
社会网络分析是当今数据挖掘中最重要的研究领域之一。对这些网络进行分析的目的是提取数据集中的嵌入式知识,了解用户在社交网络环境中的行为。链接预测是社交网络分析最具吸引力和最核心的应用之一。社交网络中链接预测的目的是识别来自用户的缺失和未知的信息,或者预测两个用户之间未来的链接。近年来,各种人工智能算法被引入,作为解决链接预测和大数据的重要工具之一。在本研究中,采用一种基于元启发式的策略来改进社交网络中的链接预测。该方法基于所提供的签名社会网络的特征,将链接预测问题转化为两类分类问题。然后利用粒子群优化(PSO)的能力和社交网络图的拓扑属性创建了一个包含两类的数据库,第一类指向用户之间存在连接,第二类指向不存在这种关系。使用支持向量机模型创建用于分类工作的数据库,并使用经典的Katz相似性标准进行最终用户建议。并利用Twitter社交网络信息对所提出的方法进行比较和评价。实验结果表明,在F-measure准则上,与Meta-Path、Katz和CN算法相比,本文方法的优势分别为0.23、0.99和6.32。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of a method for increasing the reliability of distributed software systems on cloud systems platform Modern symmetric searchable encryption technique for string classification in cloud technology Funding the library Organizational records management at Effia Nkwanta Regional, Takoradi Lack of concern for institutional libraries and its effects
×
引用
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