融合双重正则化机制的低秩矩阵分解推荐模型

基于矩阵分解技术的社会化推荐通过加入用户信任关系来加强学习准确性，但忽略了物品之间的关联信息在模型分解过程中对用户兴趣的影响。对此首先提出在物品相似度计算方法中加入用户参与度进行改进，并构建了融合物品关联正则项和信任用户正则项双重约束的矩阵分解推荐模型，在优化隐式特征矩阵过程中体现了物品之间的关联信息对推荐的重要影响。最后通过对两个不同稀疏级别的数据集的实验证明，相比主流的矩阵分解模型，提出的双重正则项的矩阵分解模型能够提高稀疏数据集上预测评分的准确性，并能明显缓解用户冷启动问题。

Low-rank matrix factorization recommendation model based on double regularization mechanism

Social recommendation based on matrix factorization enhances the learning accuracy by adding user trust relationship, but ignored the influence of related information between items on user interest in the process of model decomposition. This paper first provided an improved item similarity function to measure correlations between items by considering the user frequency factor, and then established a matrix factorization model with two regularization terms, which combined item relations regularization and social regularization into matrix factorization objective function to present the constraints on low rank approximation. It explored a major impact of the item association information on recommendation when optimizing the implicit feature matrix. The experiments on two real-world datasets demonstrate that this method outperforms other state-of-the-art matrix factorization approaches especially dealing with the large sparse data, and effectively alleviates the cold-start user problem.