Personalized Sliding Window Recommendation Algorithm Based on Sequence Alignment.

IF 2
Lei Zhou, Bolun Chen, Hu Liu, Liuyang Wang
{"title":"Personalized Sliding Window Recommendation Algorithm Based on Sequence Alignment.","authors":"Lei Zhou,&nbsp;Bolun Chen,&nbsp;Hu Liu,&nbsp;Liuyang Wang","doi":"10.3390/e24111662","DOIUrl":null,"url":null,"abstract":"<p><p>With the explosive growth of the amount of information in social networks, the recommendation system, as an application of social networks, has attracted widespread attention in recent years on how to obtain user-interested content in massive data. At present, in the process of algorithm design of the recommending system, most methods ignore structural relationships between users. Therefore, in this paper, we designed a personalized sliding window for different users by combining timing information and network topology information, then extracted the information sequence of each user in the sliding window and obtained the similarity between users through sequence alignment. The algorithm only needs to extract part of the data in the original dataset, and the time series comparison shows that our method is superior to the traditional algorithm in recommendation Accuracy, Popularity, and Diversity.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2022-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689343/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy (Basel, Switzerland)","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e24111662","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the explosive growth of the amount of information in social networks, the recommendation system, as an application of social networks, has attracted widespread attention in recent years on how to obtain user-interested content in massive data. At present, in the process of algorithm design of the recommending system, most methods ignore structural relationships between users. Therefore, in this paper, we designed a personalized sliding window for different users by combining timing information and network topology information, then extracted the information sequence of each user in the sliding window and obtained the similarity between users through sequence alignment. The algorithm only needs to extract part of the data in the original dataset, and the time series comparison shows that our method is superior to the traditional algorithm in recommendation Accuracy, Popularity, and Diversity.

Abstract Image

Abstract Image

Abstract Image

基于序列比对的个性化滑动窗口推荐算法。
随着社交网络信息量的爆发式增长,推荐系统作为社交网络的一种应用,如何从海量数据中获取用户感兴趣的内容,近年来受到了广泛关注。目前,在推荐系统的算法设计过程中,大多数方法忽略了用户之间的结构关系。因此,本文结合时序信息和网络拓扑信息,设计了针对不同用户的个性化滑动窗口,然后提取滑动窗口中每个用户的信息序列,通过序列比对得到用户之间的相似性。该算法只需要提取原始数据集中的部分数据,时间序列对比表明,我们的方法在推荐精度、流行度和多样性方面都优于传统算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书