矩阵分解
计算机科学
协同过滤
矩阵范数
相似性(几何)
张量(固有定义)
非负矩阵分解
分解
推荐系统
基质(化学分析)
数据挖掘
塔克分解
稀疏矩阵
张量分解
理论计算机科学
人工智能
机器学习
数学
生态学
材料科学
复合材料
纯数学
图像(数学)
生物
特征向量
物理
量子力学
高斯分布
作者
Shenbao Yu,Zhehao Zhou,Bilian Chen,Lei Cao
标识
DOI:10.1016/j.ins.2023.03.018
摘要
In the real world, user preferences change dynamically. Therefore, time-aware recommendation systems have attracted more attention in both academia and industry. In the literature, tensor decomposition-based models and matrix factorization-based models can handle large-scale sparse data well. However, to the best of our knowledge, there is no work that provides an explanation of the latent time factor embedded in the models. Moreover, conventional Frobenius norm-based models cannot well describe the dynamic changes in user preferences over time. To capture the dynamic changes in user preferences, we interpret the time latent factor vector as a transition matrix of user preferences. In addition, a novel temporal similarity measure is proposed accordingly, which considers dynamic user and item changes between two adjacent time slices. Moreover, we propose a generalized temporal similarity-based nonnegative tensor decomposition (GTS-NTD) model and provide the corresponding solution method. Experiments on three datasets suggest that our proposed method can improve recommendation performance under dynamic changes in user preferences.
科研通智能强力驱动
Strongly Powered by AbleSci AI