首页 | 本学科首页   官方微博 | 高级检索  
     

面向群组用户时序行为的动态推荐算法
引用本文:温雯,刘芳,蔡瑞初,郝志峰.面向群组用户时序行为的动态推荐算法[J].计算机应用,2021,41(1):60-66.
作者姓名:温雯  刘芳  蔡瑞初  郝志峰
作者单位:1. 广东工业大学 计算机学院, 广州 510000;2. 佛山科学技术学院 数学与大数据学院, 广东 佛山 528000
摘    要:针对现实系统中用户偏好随时间动态变化且一个用户ID背后可能是一个家庭的多个成员在共用的问题,提出一种为这类隐含多个类型成员行为的群组用户解决其偏好随时间而变化的动态推荐算法。首先,假设用户的历史行为数据包括曝光数据和点击数据,并通过学习当前时刻下群组用户的各类型角色权重来判别当前成员角色;其次,根据曝光数据提出两种设计思路来构造流行度模型,并采用逆倾向评分加权方法来平衡训练数据;最后,利用矩阵分解技术得出随时间变化的用户潜在偏好因子和物品潜在属性因子,计算两者内积后得出用户随时间变化的Top-K偏好推荐。实验结果表明,该算法在召回率、平均精度均值(MAP)、归一化折损累计增益(NDCG)这三个指标上一天24个时刻中均能有至少16个时刻的表现优于基准方法,并能缩短运行时间,降低计算的时间复杂度

关 键 词:群组用户  曝光数据  时序行为  矩阵分解  偏好推荐  
收稿时间:2020-07-11
修稿时间:2020-07-23

Dynamic recommendation algorithm for group-users'temporal behaviors
WEN Wen,LIU Fang,CAI Ruichu,HAO Zhifeng.Dynamic recommendation algorithm for group-users'temporal behaviors[J].journal of Computer Applications,2021,41(1):60-66.
Authors:WEN Wen  LIU Fang  CAI Ruichu  HAO Zhifeng
Affiliation:1. School of Computers, Guangdong University of Technology, Guangzhou Guangdong 510000, China;2. School of Mathematics and Big Data, Foshan University, Foshan Guangdong 528000, China
Abstract:Focusing on the issue that the user preferences change with time in the real system,and a user ID may be shared by multiple members of a family,a dynamic recommendation algorithm for the group-users who contained multiple types of members and have preferences varying with time was proposed.Firstly,it was assumed that the user’s historical behavior data were composed of exposure data and click data,and the current member role was discriminated by learning the role weights of all types of members of the group-user at the present moment.Secondly,two design ideas were proposed according to the exposure data to construct a popularity model,and the training data were balanced by adopting the inverse propensity score weighting.Finally,the matrix factorization technique was used to obtain the user latent preference factor varying with time and the item latent attribute factor,and the inner products of the former and the latter were calculated to obtain the Top-K preference recommendations of the user which vary with time.Experimental results show that the proposed algorithm not only outperforms the benchmark method at least 16 moments in 24 moments a day on three metrics of Recall,Mean Average Precision(MAP),and Normalized Discounted Cumulative Gain(NDCG),but also shortens the running time and reduces the time complexity of calculation.
Keywords:group-user  exposure data  temporal behavior  matrix factorization  preference recommendation
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号