融合用户信任关系和神经网络的推荐模型
A Recommendation Model Integrating User Trust Relationship and Neural Network
DOI: 10.12677/MOS.2023.123167, PDF,    国家自然科学基金支持
作者: 于佳玄:上海理工大学理学院,上海;丁德锐*:上海理工大学控制科学与工程系,上海
关键词: 矩阵分解信任关系被信任关系神经网络Matrix Factorization Trust Relationship Trusted Relationship Neural Network
摘要: 矩阵分解(Matrix Factorization, MF)是构建推荐系统的有效方法之一。然而,传统的矩阵分解模型在应用于大规模稀疏数据场景时依然存在推荐准确率较差、训练速度较慢等严重不足。本文从提高推荐准确率和减少时间花销这两方面考虑,提出一种基于神经网络(Neural Network, NN)的融合用户信任关系(Trust)的矩阵分解(NN-MF-TR)模型。一方面,通过用户间潜在的信任与被信任关系充分挖掘用户的潜在偏好,从而提高推荐准确率。另一方面,在训练模型时引入神经网络,减少因多次迭代所造成的巨大时间花销。最后,通过选取四个有代表性的对比模型并在四个真实世界数据集上进行了实验验证。实验结果表明,本文提出的NN-MF-TR模型能够在保证提高推荐准确率的同时大大减少时间花销。
Abstract: Matrix factorization is one of the effective methods to construct recommendation system. However, the traditional matrix factorization model still faces the problems of both poor recommendation accuracy and low training speed when applied to the case with large-scale sparse data. In order to improve the recommendation accuracy while reducing the time cost, this paper proposes an NN-based matrix factorization model combining user trust relationships (NN-MF-TR). First, the la-tent preference of users is fully mined through the latent trust and trusted relationships between users, so as to improve the recommendation accuracy. Then, a neural network is introduced to train the constructed model to reduce the huge time cost caused by multiple iterations. Finally, four rep-resentative comparison models are selected and tested on four real-world data sets. The results show that the NN-MF-TR model proposed in this paper can greatly reduce the time cost while en-suring the recommendation accuracy.
文章引用:于佳玄, 丁德锐. 融合用户信任关系和神经网络的推荐模型[J]. 建模与仿真, 2023, 12(3): 1807-1819. https://doi.org/10.12677/MOS.2023.123167

参考文献

[1] 刘君良, 李晓光. 个性化推荐系统技术进展[J]. 计算机科学, 2020, 47(7): 47-55.
[2] 于蒙, 何文涛, 周绪川, 等. 推荐系统综述[J]. 计算机应用, 2022, 42(6): 1898-1913.
[3] Cao, B., Zhang, Y.T., Zhao, Z.W., Liu, X., Skonieczny, Ł. and Lv, Z. (2022) Recommendation Based on Large-Scale Many-Objective Optimization for the Intelligent Internet of Things System. IEEE Internet of Things Journal, 9, 15030-15038. [Google Scholar] [CrossRef
[4] Liu, H., Zheng, C., Li, D.C., et al. (2022) EDMF: Efficient Deep Matrix Factorization with Review Feature Learning for Industrial Recommender Sys-tem. IEEE Transactions on Industrial Informatics, 18, 4361-4371. [Google Scholar] [CrossRef
[5] 吴正洋, 汤庸, 刘海. 个性化学习推荐研究综述[J]. 计算机科学与探索, 2022, 16(1): 21-40.
[6] 刘华锋, 景丽萍, 于剑. 融合社交信息的矩阵分解推荐方法研究综述[J]. 软件学报, 2018, 29(2): 340-362.
[7] Ma, H., Yang, H., Lyu, M.R. and King, I. (2008) SoRec: Social Recommendation Using Probabilistic Matrix Factorization. Proceedings of the 17th ACM Conference on Information and Knowledge Management, Napa Valley, 26-30 October 2008, 931-940. [Google Scholar] [CrossRef
[8] Guo, G., Zhang, J. and Yorke-Smith, N. (2015) TrustSVD: Collaborative Filtering with Both the Explicit and Implicit Influence of User Trust and of Item Ratings. Pro-ceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, Palo Alto, 22 February-1 March 2022, 123-129. [Google Scholar] [CrossRef
[9] Luo, X., Zhou, M.C., Xia, Y.N. and Zhu, Q.S. (2014) An Efficient Non-Negative Matrix-Factorization-Based Approach to Collaborative Filtering for Recommender Systems. IEEE Transactions on Industrial Informatics, 10, 1273-1284. [Google Scholar] [CrossRef
[10] Luo, X., Zhou, M.C., Li, S., You, Z., Xia, Y. and Zhu, Q. (2016) A Nonnegative Latent Factor Model for Large-Scale sparse MATRICES in Recommender Systems via Alternating Direction Method. IEEE Transactions on Neural Networks and Learning Systems, 27, 579-592. [Google Scholar] [CrossRef
[11] Song, Y., Li, M., Luo, X., Yang, G. and Wang, C. (2020) Improved Symmetric and Non-Negative Matrix Factorization models for Undirected Sparse and Large-Scaled Networks: A Trip Factoriza-tion-Based Approach. IEEE Transactions on Industrial Informatics, 16, 3006-3017. [Google Scholar] [CrossRef
[12] Luo, X., Liu, Z.G., Li, S., Shang, M. and Wang, Z. (2021) A Fast Non-Negative Latent Factor Model Based on Generalized Momentum Method. IEEE Transactions on Systems, Man and Cy-bernetics: Systems, 51, 610-620. [Google Scholar] [CrossRef
[13] Zhang, G.J., Liu, Y. and Jin, X.N. (2019) A Survey of Autoencod-er-Based Recommender Systems. Frontiers of Computer Science, 14, 430-450. [Google Scholar] [CrossRef
[14] Jiang, J.J., Li, W.L., Dong, A.N., Gou, Q.H. and Luo, X. (2020) A Fast Deep AutoEncoder for High-Dimensional and Sparse Matrices in Recommender Systems. Neurocomputing, 412, 381-391. [Google Scholar] [CrossRef
[15] Luo, X., Liu, Z., Shang, M.S., et al. (2021) Highly-Accurate Commu-nity Detection via Pointwise Mutual Information-Incorporated Symmetric Mon-Negative Matrix Factorization. IEEE Transac-tions on Network Science and Engineering, 8, 463-476. [Google Scholar] [CrossRef
[16] 钱冲, 常冬霞. 图拉普拉斯正则化稀疏变换学习图像去噪算法[J]. 计算机工程与应用, 2022, 58(5): 232-239.
[17] Yuan, Y., He, Q., Luo, X. and Shang, M.S. (2022) A Multilayered-and-Randomized Latent Factor Model for High-Dimensional and Sparse Matrices. IEEE Transactions on Big Data, 8, 784-794. [Google Scholar] [CrossRef
[18] Guliyev, N.J. and Ismailov, V.E. (2015) A Single Hidden Layer Feedforward Network with Only One Neuron in the Hidden Layer Can Approximate Any Univariate Function. Neural Com-putation, 28, 1289-1304. [Google Scholar] [CrossRef
[19] Bacciu, D., Colombo, M., Morelli, D. and Plans, D. (2018) Randomized Neural Networks for Preference Learning with Physiological Data. Neurocomputing, 298, 9-20. [Google Scholar] [CrossRef
[20] Yi, B.L., Shen, X.X., Liu, H., et al. (2019) Deep Matrix Factorization with Implicit Feedback Embedding for Recommendation System. IEEE Transactions on Industrial Informatics, 15, 4591-4601. [Google Scholar] [CrossRef