雅卡索引
协同过滤
相似性(几何)
计算机科学
情报检索
点(几何)
推荐系统
数据挖掘
质量(理念)
钥匙(锁)
偏爱
皮尔逊积矩相关系数
人工智能
模式识别(心理学)
数学
统计
图像(数学)
认识论
哲学
计算机安全
几何学
出处
期刊:International Journal of Social Science and Education Research
日期:2020-04-01
卷期号:3 (4): 255-264
标识
DOI:10.6918/ijosser.202004_3(4).0036
摘要
With the rapid development of network technology, online reading platforms have emerged one after another, providing a new opportunity for book recommendation. Collaborative filtering makes use of the preferences of neighbor users to recommend and predict the interests of target users, in which similarity calculation is the key point. Because the traditional similarity methods cannot take full benefit of the potential relationship between readers. As the result of data sparsity, the similarity matrix is too sparse, which ultimately leads to low recommendation accuracy. This article quantifies the reader's author preferences to build a readers' similarity formula incorporating author preference and Pearson coefficient by introducing Jaccard coefficient, in order to describe the association between readers more comprehensively. According to the proposed similarity, the improved collaborative filtering algorithm can improve the quality of book recommendations significantly. Finally, this paper performs simulation experiments on the Book-Crossing dataset. The results show that the collaborative filtering algorithm based on the improved similarity can effectively improve the quality of personalized book recommendation.
科研通智能强力驱动
Strongly Powered by AbleSci AI