Temporal preferential attachment: Predicting new links in temporal social networks

Panchani Wickramarachchi, Lankeshwara Munasinghe
{"title":"Temporal preferential attachment: Predicting new links in temporal social networks","authors":"Panchani Wickramarachchi, Lankeshwara Munasinghe","doi":"10.1109/scse53661.2021.9568278","DOIUrl":null,"url":null,"abstract":"Social networks have shown an exponential growth in the recent past. It has estimated that nearly 4 billion people are currently using social networks. The growth of social networks can be explained using different models. Preferential Attachment (P A) is a widely used model, which is often used to link prediction in social networks. P A tells that the social network users prefer to get linked with popular users in the network. However, the popularity of a node depends not only on the node's degree but also on the node's activeness which is reflected by the amount of active links the node has at present. Activeness of a link can be quantified using the timestamp of the link. The present work introduces a novel method called Temporal Preferential Attachment (TPA) which is defined on the activeness and strength of a node. Strength of a node is the sum of weights of links attached to the node. Here, the weights of the links are assigned according to their activeness. Thus, TP A captures the temporal behaviors of nodes, which is a vital factor for new link formation. The novel method uses min - max scaling to scale the time differences between current time and the timestamps of the links. Here, the min value is the earliest timestamp of the links in the given network and max value is the latest timestamp of the links. The scaled time difference of a link is considered as the temporal weight of the link, which reflects its activeness. TP A was evaluated in terms of its link prediction performance using well-known social network data sets. The results show that TP A performs well in link prediction compared to P A, and show a significant improvement in prediction accuracy.","PeriodicalId":319650,"journal":{"name":"2021 International Research Conference on Smart Computing and Systems Engineering (SCSE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Research Conference on Smart Computing and Systems Engineering (SCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/scse53661.2021.9568278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Social networks have shown an exponential growth in the recent past. It has estimated that nearly 4 billion people are currently using social networks. The growth of social networks can be explained using different models. Preferential Attachment (P A) is a widely used model, which is often used to link prediction in social networks. P A tells that the social network users prefer to get linked with popular users in the network. However, the popularity of a node depends not only on the node's degree but also on the node's activeness which is reflected by the amount of active links the node has at present. Activeness of a link can be quantified using the timestamp of the link. The present work introduces a novel method called Temporal Preferential Attachment (TPA) which is defined on the activeness and strength of a node. Strength of a node is the sum of weights of links attached to the node. Here, the weights of the links are assigned according to their activeness. Thus, TP A captures the temporal behaviors of nodes, which is a vital factor for new link formation. The novel method uses min - max scaling to scale the time differences between current time and the timestamps of the links. Here, the min value is the earliest timestamp of the links in the given network and max value is the latest timestamp of the links. The scaled time difference of a link is considered as the temporal weight of the link, which reflects its activeness. TP A was evaluated in terms of its link prediction performance using well-known social network data sets. The results show that TP A performs well in link prediction compared to P A, and show a significant improvement in prediction accuracy.
时间优先依恋:预测时间社会网络中的新联系
最近,社交网络呈指数级增长。据估计,目前有近40亿人在使用社交网络。社交网络的增长可以用不同的模型来解释。优先依恋是一种应用广泛的模型,常用于社会网络的链接预测。P A告诉我们,社交网络用户更喜欢与网络中的热门用户建立联系。然而,一个节点的受欢迎程度不仅取决于节点的程度,还取决于节点的活跃度,活跃度反映在节点目前拥有的活跃链接数上。链路的活跃度可以通过链路的时间戳来量化。本文提出了一种基于节点活跃度和强度的时间优先依恋(TPA)方法。节点的强度是该节点上所有链路的权重之和。在这里,权重的链接是根据他们的活跃度分配。因此,TP A捕获节点的时间行为,这是新链路形成的重要因素。该方法采用最小-最大缩放法对链路当前时间和时间戳之间的时间差进行缩放。这里,最小值是给定网络中链路的最早时间戳,最大值是链路的最晚时间戳。一个环节的尺度时差被认为是该环节的时间权重,反映了该环节的活跃度。使用知名的社交网络数据集对TP A的链接预测性能进行了评估。结果表明,TP - A算法在链路预测方面优于P - A算法,预测精度有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信