基于时序变化与用户聚类的提高总体多样性的方法
Aggregate Diversity Improvement Method Based on Time Series Change and User Clustering
DOI: 10.12677/SA.2021.105088, PDF,   
作者: 宋金林:天津商业大学理学院,天津;姜书浩, 郝 运:天津商业大学信息工程学院,天津
关键词: 协同过滤时间因子SVD聚类多样性Collaborative Filtering Time Factor SVD Clustering Diversity
摘要: 针对传统协同过滤算法数据稀疏性、相似度计算片面、多样性不足等问题,本文提出一种基于时序变化与用户聚类的提高总体多样性的方法(Aggregate diversity improvement method based on time series change and user clustering, ADI-TC, n = 3)。通过加入时间因子对预测评分进行加权提高用户评分实时性;采用奇异值分解法(Singular Value Decomposition, SVD)进行数据填充缓解数据稀疏性问题;根据用户偏好对用户进行聚类,结合用户评分和类别相似度计算用户综合相似度;通过跨类选取近邻的方式提高协同用户多样性进而提高推荐结果多样性。在MovieLens数据集实验表明本文方法相对于传统基于用户的协同过滤算法,在最近邻数为20时,MAE下降4.5%,总体多样性可以提高2%。说明本文提出的方法能在保证推荐准确性的前提下提高总体多样性。
Abstract: Aiming at the problems of traditional collaborative filtering algorithms, such as data sparsity, partial similarity calculation and insufficient diversity, this paper proposes an aggregate diversity improvement method based on time series change and user clustering (ADI-TC, n = 3) to improve the aggregate diversity. By adding time factor, the prediction rating is weighted to improve the real-time performance of user rating. Singular Value Decomposition (SVD) is used for data filling to alleviate the problem of data sparsity. Users were clustered according to their preferences, and user comprehensive similarity was calculated by combining user rating and category similarity. The nearest neighbor across classes methods were selected to improve the diversity of collaborative users and improve the diversity of recommendation results. Experiments on the Movielens data set show that compared with the traditional user-based collaborative filtering algorithm, the MAE of the proposed method decreases by 4.5% when the nearest neighbor number is 20, and the aggregate diversity can be improved by 2%. It shows that the method proposed in this paper can improve the aggregate diversity while ensuring the accuracy of recommendations.
文章引用:宋金林, 姜书浩, 郝运. 基于时序变化与用户聚类的提高总体多样性的方法[J]. 统计学与应用, 2021, 10(5): 845-854. https://doi.org/10.12677/SA.2021.105088

参考文献

[1] McNee, S.M., Riedl, J. and Konstan, J.A. (2006) Being Accurate Is Not Enough: How Accuracy Metrics Have Hurt Recommender Systems. CHI’06 Extended Abstracts on Human Factors in Computing Systems, Montréal, 22-27 April 2006, 1097-1101.
[Google Scholar] [CrossRef
[2] Cremonesi, P., Garzotto, F., Negro, S., et al. (2011) Looking for “Good” Recommendations: A Comparative Evaluation of Recommender Systems. In: Human-Computer Interaction-INTERACT, Springer, Berlin, 152-168.
[Google Scholar] [CrossRef
[3] Cremonesi, P., Koren, Y. and Turrin, R. (2010) Performance of Recommender Algorithms on Top-n Recommendation Tasks. Proceedings of the Fourth ACM Conference on Recommender Systems, New York, 39-46.
[Google Scholar] [CrossRef
[4] Adamopoulos, P. and Tuzhilin, A. (2014) On Over-Specialization and Concentration Bias of Recommendations: Probabilistic Neighborhood Selection in Collaborative Filtering Systems. Proceedings of the 8th ACM Conference on Recommender Systems, Foster City, 6-10 October 2014, 153-160.
[Google Scholar] [CrossRef
[5] Fleder, D. and Hosanagar, K. (2009) Blockbuster Culture’s Next Rise or Fall: The Impact of Recommender Systems on Sales Diversity. Management Science, 55, 697-712.
[Google Scholar] [CrossRef
[6] 刘慧婷, 岳可诚. 可提高多样性的基于推荐期望的top-N推荐方法[J]. 计算机科学, 2014, 41(7): 270-274.
[7] 邓明通, 刘学军, 李斌. 基于用户偏好和动态兴趣的多样性推荐方法[J]. 小型微型计算机系统, 2018, 39(9): 2029-2034.
[8] 姜书浩, 张立毅, 张志鑫. 基于个性化的多样性优化推荐算法[J]. 天津大学学报(自然科学与工程技术版), 2018, 51(10): 1042-1049.
[9] 赵鹏, 彭甫镕, 崔志华, 等. 一个新的针对新颖性和多样性推荐的矩阵分解模型(英文) [J]. 山西大学学报(自然科学版), 2020, 43(4): 746-755.
[10] 张凯辉, 周志平, 赵卫东. 结合CFDP与时间因子的协同过滤推荐算法[J]. 计算机工程与应用, 2020, 56(15): 80-85.
[11] 周静, 何利力. 基于用户属性偏好与时间因子的服装推荐研究[J]. 软件导刊, 2020, 19(6): 23-28.
[12] He, K., Zhang, X., Ren, S., et al. (2016) Deep Residual Learning for Image Recognition. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, 27-30 June 2016, 770-778.
[Google Scholar] [CrossRef
[13] Chen, Y.N. and Yu, M. (2016) A Hybrid Collaborative Filtering Algorithm Based on User-Item. Wuhan University Journal of Natural Sciences, No. 1, 16-20.
[14] 周林, 平西建, 徐森, 等. 基于谱聚类的聚类集成算法[J]. 自动化学报, 2012, 38(8): 1335-1342.
[15] 王璇璇, 陈宁江, 练林明, 等. 基于谱聚类和矩阵分解的改进协同过滤推荐算法[J]. 广西大学学报(自然科学版), 2020, 45(2): 313-320.
[16] 刘紫涵, 吴鹏海, 吴艳兰. 三种谱聚类算法及其应用研究[J]. 计算机应用研究, 2017, 34(4): 1026-1031.
[17] Harper, F.M. and Konstan, J.A. (2016) The Movielens Datasets. ACM Transactions on Interactive Intelligent Systems, 5, 1-19.
[Google Scholar] [CrossRef
[18] 龚敏, 邓珍荣, 黄文明. 基于用户聚类与Slope One填充的协同推荐算法[J]. 计算机工程与应用, 2018, 54(22): 139-143.
[19] 顾明星, 黄伟建, 黄远, 等. 结合用户聚类与改进用户相似性的协同过滤推荐[J]. 计算机工程与应用, 2020, 56(22): 185-190.
[20] 邓爱林, 朱扬勇, 施伯乐. 基于项目评分预测的协同过滤推荐算法[J]. 软件学报, 2003(9): 1621-1628.
[21] 张林, 王晓东, 姚宇. 基于项目聚类和时间因素改进的推荐算法[J]. 计算机应用, 2016, 36(S2): 235-238.
[22] 岳希, 唐聃, 舒红平, 等. 基于数据稀疏性的协同过滤推荐算法改进研究[J]. 工程科学与技术, 2020, 52(1): 198-202.