基于聚类与预测填充的协同过滤图书推荐算法研究
Research on Collaborative Filtering Book Recommendation Algorithm Based on Clustering and Prediction Fill
涂铁 1刘斌1
作者信息
- 1. 安徽商贸职业技术学院信息与人工智能学院,安徽 芜湖 241002
- 折叠
摘要
推荐技术作为一种能够提高用户满意度的个性化技术,在注重客户需求的场景下应用十分广泛.本文针对学校图书借阅场景提出了一种组合推荐算法,该算法在常用的协同过滤算法基础上前置了Mini Batch K-means聚类算法,并在划分后的读者簇中应用了基于图书项目特征的预测评分数据填充技术,从而降低了读者—图书矩阵的稀疏度,提高了推荐效率.实验表明,该算法相对于传统的协同过滤算法,其推荐质量得到了一定程度的提高,同时其预测评分机制也可以改善新入库图书的冷启动问题.
Abstract
As a personalized technology that can improve users satisfaction,recommendation technology is widely used in customer-oriented situations.In this paper,a combined recommendation algorithm is proposed for book rental service in school libraries.The algorithm presets the Mini Batch K-means clustering algorithm on the basis of the common collaborative filtering algorithm,and applies the predicted score data filling technology in the divided reader cluster based on the characteristics of the book items,so as to reduce the sparsity of the reader-book matrix.Therefore,the recommendation efficiency is largely improved.Experiments has revealed that compared with the traditional collaborative filtering algorithm,the recommendation quality of this algorithm has been improved to some extent,and the predictive scoring mechanism can also improve the cold start problem of new books.
关键词
图书推荐/协同过滤/聚类/数据填充/矩阵稀疏度Key words
Book Recommendation/Collaborative Filtering/Clustering/Data Filling/Matrix Sparsity引用本文复制引用
基金项目
安徽商贸职业技术学院校级项目(2022KYZ03)
安徽省教育厅自然科学研究重点项目(KJ2020A1082)
出版年
2024
NETL
NSTL
万方数据