RESEARCH ON PERSONALIZED RECOMMENDATION ALGORITHM FUSING TIME AND LOCATION

CONVERTER Pub Date : 2021-07-10 DOI:10.17762/converter.130
Zhongyong Fan, Yongqian Zhao, Yongkang Wang, Zhijun Zhang
{"title":"RESEARCH ON PERSONALIZED RECOMMENDATION ALGORITHM FUSING TIME AND LOCATION","authors":"Zhongyong Fan, Yongqian Zhao, Yongkang Wang, Zhijun Zhang","doi":"10.17762/converter.130","DOIUrl":null,"url":null,"abstract":"With development of recommendation systems, they are faced with more and more challenges. In order to relieve problems existing in commodity selection by users of different preferences from different regions, personalized recommendation based on location information has emerged. Nowadays most recommendation systems based on location information neglect the fact that users’ preference will change with time. To solve the above problem, geographic location and time factor of users are effectively combined in this paper, and a personalized recommendation algorithm TLPR combining time and location information is proposed. This algorithm determines the users’ geographic location according to postcode information of the users, uses pyramid quadtree model to distribute users into nodes at each layer in the pyramid, utilizes collaborative filtering algorithm for local recommendation in each node, introduces a time function to regulate time-dependent change of user interests when calculating user similarity at each node and finally realizes a comprehensive recommendation by distributing a weight for recommendation result at each layer in the pyramid quadtree. A comparative experience is carried out for recommendation performance of this algorithm on MovieLens dataset, and experimental results indicate that this algorithm is of better recommendation effect","PeriodicalId":10707,"journal":{"name":"CONVERTER","volume":"42 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CONVERTER","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17762/converter.130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With development of recommendation systems, they are faced with more and more challenges. In order to relieve problems existing in commodity selection by users of different preferences from different regions, personalized recommendation based on location information has emerged. Nowadays most recommendation systems based on location information neglect the fact that users’ preference will change with time. To solve the above problem, geographic location and time factor of users are effectively combined in this paper, and a personalized recommendation algorithm TLPR combining time and location information is proposed. This algorithm determines the users’ geographic location according to postcode information of the users, uses pyramid quadtree model to distribute users into nodes at each layer in the pyramid, utilizes collaborative filtering algorithm for local recommendation in each node, introduces a time function to regulate time-dependent change of user interests when calculating user similarity at each node and finally realizes a comprehensive recommendation by distributing a weight for recommendation result at each layer in the pyramid quadtree. A comparative experience is carried out for recommendation performance of this algorithm on MovieLens dataset, and experimental results indicate that this algorithm is of better recommendation effect
融合时间和地点的个性化推荐算法研究
随着推荐系统的发展,它们面临着越来越多的挑战。为了缓解不同地区用户的不同偏好在商品选择上存在的问题,基于位置信息的个性化推荐应运而生。目前大多数基于位置信息的推荐系统都忽略了用户偏好会随时间变化的事实。为解决上述问题,本文将用户的地理位置和时间因素有效结合,提出了一种结合时间和地点信息的个性化推荐算法TLPR。该算法根据用户的邮编信息确定用户的地理位置,利用金字塔四叉树模型将用户分布到金字塔各层的节点上,利用协同过滤算法在每个节点上进行局部推荐;在计算每个节点的用户相似度时,引入时间函数来调节用户兴趣随时间的变化,最终通过在金字塔四叉树的每一层分配推荐结果的权重来实现综合推荐。在MovieLens数据集上对该算法的推荐性能进行了对比体验,实验结果表明该算法具有较好的推荐效果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信