基于可靠路径的在线社交网络链接预测多层模型

Fariba Sarhangnia, Nona Ali Asgharzadeholiaee, Milad Boshkani Zadeh
{"title":"基于可靠路径的在线社交网络链接预测多层模型","authors":"Fariba Sarhangnia, Nona Ali Asgharzadeholiaee, Milad Boshkani Zadeh","doi":"10.1142/s0219649222500253","DOIUrl":null,"url":null,"abstract":"Link Prediction (LP) is one of the critical problems in Online Social Networks (OSNs) analysis. LP is a technique for predicting forthcoming or missing links based on current information in the OSN. Typically, modelling an OSN platform is done in a single-layer scheme. However, this is a limitation which might lead to incorrect descriptions of some real-world details. To overcome this limitation, this paper presents a multilayer model of OSN for the LP problem by analysing Twitter and Foursquare networks. LP in multilayer networks involves performing LP on a target layer benefitting from the structural information of the other layers. Here, a novel criterion is proposed, which calculates the similarity between users by forming intralayer and interlayer links in a two-layer network (i.e. Twitter and Foursquare). Particularly, LP in the Foursquare layer is done by considering the two-layer structural information. In this paper, according to the available information from the Twitter and Foursquare OSNs, a weighted graph is created and then various topological features are extracted from it. Based on the extracted features, a database with two classes of link existence and no link has been created, and therefore the problem of LP has become a two-class classification problem that can be solved by supervised learning methods. To prove the better performance of the proposed method, Katz and FriendLink indices as well as SEM-Path algorithm have been used for comparison. Evaluations results show that the proposed method can predict new links with better precision.","PeriodicalId":127309,"journal":{"name":"J. Inf. Knowl. Manag.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Novel Multilayer Model for Link Prediction in Online Social Networks Based on Reliable Paths\",\"authors\":\"Fariba Sarhangnia, Nona Ali Asgharzadeholiaee, Milad Boshkani Zadeh\",\"doi\":\"10.1142/s0219649222500253\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link Prediction (LP) is one of the critical problems in Online Social Networks (OSNs) analysis. LP is a technique for predicting forthcoming or missing links based on current information in the OSN. Typically, modelling an OSN platform is done in a single-layer scheme. However, this is a limitation which might lead to incorrect descriptions of some real-world details. To overcome this limitation, this paper presents a multilayer model of OSN for the LP problem by analysing Twitter and Foursquare networks. LP in multilayer networks involves performing LP on a target layer benefitting from the structural information of the other layers. Here, a novel criterion is proposed, which calculates the similarity between users by forming intralayer and interlayer links in a two-layer network (i.e. Twitter and Foursquare). Particularly, LP in the Foursquare layer is done by considering the two-layer structural information. In this paper, according to the available information from the Twitter and Foursquare OSNs, a weighted graph is created and then various topological features are extracted from it. Based on the extracted features, a database with two classes of link existence and no link has been created, and therefore the problem of LP has become a two-class classification problem that can be solved by supervised learning methods. To prove the better performance of the proposed method, Katz and FriendLink indices as well as SEM-Path algorithm have been used for comparison. Evaluations results show that the proposed method can predict new links with better precision.\",\"PeriodicalId\":127309,\"journal\":{\"name\":\"J. Inf. Knowl. Manag.\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Inf. Knowl. Manag.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219649222500253\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Inf. Knowl. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219649222500253","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

链路预测(Link Prediction, LP)是在线社交网络(Online Social network, osn)分析中的关键问题之一。LP是一种基于OSN中当前信息预测即将到来或缺失的链路的技术。通常,OSN平台的建模是在单层方案中完成的。然而,这是一个限制,可能会导致对一些现实世界细节的不正确描述。为了克服这一局限性,本文通过对Twitter和Foursquare网络的分析,提出了面向LP问题的多层OSN模型。多层网络中的LP涉及利用其他层的结构信息在目标层上执行LP。在这里,我们提出了一个新的标准,它通过在两层网络(即Twitter和Foursquare)中形成层内和层间链接来计算用户之间的相似性。其中,Foursquare层的LP是通过考虑两层结构信息来实现的。本文根据Twitter和Foursquare的可用osn信息,创建一个加权图,然后从中提取各种拓扑特征。基于提取的特征,创建了一个有链路存在和无链路两类的数据库,从而LP问题变成了一个可以用监督学习方法解决的两类分类问题。为了证明该方法具有更好的性能,我们使用Katz和FriendLink指标以及SEM-Path算法进行了比较。评价结果表明,该方法能较好地预测新链接。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Novel Multilayer Model for Link Prediction in Online Social Networks Based on Reliable Paths
Link Prediction (LP) is one of the critical problems in Online Social Networks (OSNs) analysis. LP is a technique for predicting forthcoming or missing links based on current information in the OSN. Typically, modelling an OSN platform is done in a single-layer scheme. However, this is a limitation which might lead to incorrect descriptions of some real-world details. To overcome this limitation, this paper presents a multilayer model of OSN for the LP problem by analysing Twitter and Foursquare networks. LP in multilayer networks involves performing LP on a target layer benefitting from the structural information of the other layers. Here, a novel criterion is proposed, which calculates the similarity between users by forming intralayer and interlayer links in a two-layer network (i.e. Twitter and Foursquare). Particularly, LP in the Foursquare layer is done by considering the two-layer structural information. In this paper, according to the available information from the Twitter and Foursquare OSNs, a weighted graph is created and then various topological features are extracted from it. Based on the extracted features, a database with two classes of link existence and no link has been created, and therefore the problem of LP has become a two-class classification problem that can be solved by supervised learning methods. To prove the better performance of the proposed method, Katz and FriendLink indices as well as SEM-Path algorithm have been used for comparison. Evaluations results show that the proposed method can predict new links with better precision.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Knowledge Management in Higher Education in Vietnam: Insights from Higher Education Leaders - An Exploratory Study The Organisation's Size-Innovation Performance Relationship: The Role of Human Resource Development Mechanisms A Comparative Review of Sentimental Analysis Using Machine Learning and Deep Learning Approaches Vocational Education Information Technology Based on Cross-Attention Fusion Knowledge Map Recommendation Algorithm Redesigning Knowledge Management Through Corporate Sustainability Strategy in the Post-Pandemic Era
×
引用
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