Link prediction algorithm based on time-step weights and node similarities

Cong Lin, Yating Su, Longwen Yang
{"title":"Link prediction algorithm based on time-step weights and node similarities","authors":"Cong Lin, Yating Su, Longwen Yang","doi":"10.1109/IIP57348.2022.00053","DOIUrl":null,"url":null,"abstract":"Social network node link prediction is an important topic in the field of data mining, and the link prediction algorithm based on node similarity is one of the popular algorithms. In this paper, we propose a link prediction algorithm based on time-step weights and node similarities (TSW). The proposed TSW algorithm improves the accuracy of link prediction from three aspects. Firstly, different neighbor nodes are treated differently considering common neighbor nodes to highlight the degree of contribution of different neighbor nodes to calculate the similarity between nodes, which helps to improve the accuracy of link prediction. Secondly, the temporal properties of social networks are combined, i.e., multiple consecutive network snapshots are used to help predict links. What’s more, the weights are assigned to network snapshots based on the distance in time to highlight the influence of network snapshots from different periods on the prediction. Finally, a moving average of the degrees of the nodes is applied to attenuate the influence of noisy data, making more accurate prediction results. The experimental results show that our proposed TSW algorithm obtains higher accuracy compared with most existing link prediction algorithms.","PeriodicalId":412907,"journal":{"name":"2022 4th International Conference on Intelligent Information Processing (IIP)","volume":"46 36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Intelligent Information Processing (IIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIP57348.2022.00053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Social network node link prediction is an important topic in the field of data mining, and the link prediction algorithm based on node similarity is one of the popular algorithms. In this paper, we propose a link prediction algorithm based on time-step weights and node similarities (TSW). The proposed TSW algorithm improves the accuracy of link prediction from three aspects. Firstly, different neighbor nodes are treated differently considering common neighbor nodes to highlight the degree of contribution of different neighbor nodes to calculate the similarity between nodes, which helps to improve the accuracy of link prediction. Secondly, the temporal properties of social networks are combined, i.e., multiple consecutive network snapshots are used to help predict links. What’s more, the weights are assigned to network snapshots based on the distance in time to highlight the influence of network snapshots from different periods on the prediction. Finally, a moving average of the degrees of the nodes is applied to attenuate the influence of noisy data, making more accurate prediction results. The experimental results show that our proposed TSW algorithm obtains higher accuracy compared with most existing link prediction algorithms.
基于时间步权和节点相似度的链路预测算法
社交网络节点链接预测是数据挖掘领域的一个重要课题,基于节点相似度的链接预测算法是目前比较流行的算法之一。本文提出了一种基于时间步长权重和节点相似度(TSW)的链路预测算法。提出的TSW算法从三个方面提高了链路预测的准确性。首先,考虑共同邻居节点,对不同邻居节点进行区别对待,突出不同邻居节点的贡献程度,计算节点间的相似度,有助于提高链路预测的准确性;其次,结合社交网络的时间属性,即使用多个连续的网络快照来帮助预测链接。并且根据时间距离对网络快照进行权重分配,突出不同时期的网络快照对预测的影响。最后,采用节点度的移动平均来减弱噪声数据的影响,使预测结果更加准确。实验结果表明,与大多数现有的链路预测算法相比,我们提出的TSW算法具有更高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信