融合协同过滤与关联规则的图书馆图书选择算法OA
Library Book Selection Algorithm Integrating Collaborative Filtering and Association Rules
针对传统图书推荐方法存在的数据稀疏性和推荐多样性不足等问题,提出一种融合协同过滤与关联规则的图书馆图书选择算法.所提出的算法结合用户相似度和图书相似度对稀疏矩阵中的缺失值进行合理填充,并利用关联规则挖掘图书间的潜在关联,以提高推荐的准确性和多样性.实验采用LibraryThing数据集和Book-Crossing数据集进行验证.结果表明,所提出的算法的均方根误差分别为0.89和0.84,平均绝对误差分别为0.72和0.69,平均响应时间为76.57 ms.与基于内容的推荐算法、矩阵分解算法和深度神经网络推荐算法相比,所提出的算法在准确性、推荐多样性和实时性方面均表现出显著优势,能够为图书馆个性化推荐提供有效的解决方案.
This study proposes a library book selection algorithm integrating collaborative filtering and association rules,aiming to solve the problems of data sparsity and insufficient recommendation diversity of traditional book recommendation methods.The proposed algorithm reasonably fills the missing values in the sparse matrix by combining user similarity and book similari-ty,and uses association rules to mine potential associations between books,so as to improve the accuracy and diversity of rec-ommendations.The experiment is validated by the LibraryThing dataset and the Book-Crossing dataset.The results show that the root mean square errors of the proposed algorithm are 0.89 and 0.84,the mean absolute errors are 0.72 and 0.69,and the average response time is 76.57 ms.Compared with content-based recommendation,matrix factorization and deep neural net-work recommendation algorithms,the proposed algorithm shows significant advantages in accuracy,recommendation diversity and real-time performance,and can provide an effective solution for personalized recommendation in libraries.
杨晓亮;张磊
宝鸡文理学院,图书馆,陕西,宝鸡 721016宝鸡文理学院,物理与光电技术学院,陕西,宝鸡 721016
社会科学
协同过滤关联规则数据挖掘图书选择算法
collaborative filteringassociation rulesdata miningbook selection algorithm
《微型电脑应用》 2026 (7)
42-45,50,5
校级纵向基金项目(Y0K2018012)
评论