Association Rule Model of On-demand Lending Recommendation for University Library

被引:1
|
作者
Xu, Shixin [1 ]
机构
[1] Huaiyin Inst Technol, Huaian 223003, Jiangsu, Peoples R China
关键词
library; recommendation; association rules; Bayes;
D O I
10.31449/inf.v44i3.3295
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
University library that is connected to the Internet is more convenient to search, but the huge amount of data is not convenient for users who lack a precise target. In this study, the traditional association rule algorithm was improved by a Bayesian algorithm, and then simulation experiment was carried out taking borrowing records of 1000 students as examples. In order to verify the effectiveness of the improved algorithm, it was compared with the traditional association rule algorithm and collaborative filtering algorithm. The results showed that the recommendation results of the improved association rule recommendation algorithm were more relevant to students' majors, and the coincidence degree of different students was low. In the objective evaluation of the performance of the algorithm, the accuracy, recall rate and F value showed that the personalized recommendation performance of the improved association rule algorithm was better and the improved association rule algorithm could recommend users with the book type that they need.
引用
收藏
页码:395 / 399
页数:5
相关论文
共 50 条
  • [31] A Hybrid Recommendation Model for Community Attributes of Social Networks Based on Association Rule Mining
    Lu Xing-hua
    Huang Hao-Hong
    Wu Hong-Yu
    Liu Wen-Lin
    2018 3RD INTERNATIONAL CONFERENCE ON MECHANICAL, CONTROL AND COMPUTER ENGINEERING (ICMCCE), 2018, : 420 - 424
  • [32] Cultural tourism attraction recommendation model based on optimized weighted association rule algorithm
    Jiang, Rui
    Dai, Bin
    SYSTEMS AND SOFT COMPUTING, 2024, 6
  • [33] THE BRITISH-LIBRARY-LENDING-DIVISIONS 1983 DEMAND-SUPPLY SURVEY
    MERRY, K
    PALMER, T
    INTERLENDING & DOCUMENT SUPPLY, 1984, 12 (03): : 101 - 103
  • [34] Parallel rule-based selective sampling and on-demand learning to rank
    Freitas, Mateus F. e
    Sousa, Daniel X.
    Martins, Wellington S.
    Rosa, Thierson C.
    Silva, Rodrigo M.
    Goncalves, Marcos A.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2019, 31 (18):
  • [35] An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog
    Elhalawati, Ali
    Kroetzsch, Markus
    Mennicke, Stephan
    RULES AND REASONING, RULEML+RR 2022, 2022, 13752 : 146 - 163
  • [36] Reinforcement Learning-Based Dynamic Order Recommendation for On-Demand Food Delivery
    Wang, Xing
    Wang, Ling
    Dong, Chenxin
    Ren, Hao
    Xing, Ke
    TSINGHUA SCIENCE AND TECHNOLOGY, 2024, 29 (02): : 356 - 367
  • [37] Recommendation-based Team Formation for On-demand Taxi-calling Platforms
    Zhang, Lingyu
    Song, Tianshu
    Tong, Yongxin
    Zhou, Zimu
    Li, Dan
    Ai, Wei
    Zhang, Lulu
    Wu, Guobin
    Liu, Yan
    Ye, Jieping
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 59 - 68
  • [38] Tourism Destination Recommendation Based on Association Rule Algorithm
    Lou, Na
    MOBILE INFORMATION SYSTEMS, 2022, 2022
  • [39] Robustness of Collaborative Recommendation Based On Association Rule Mining
    Sandvig, J. J.
    Mobasher, Bamshad
    Burke, Robin
    RECSYS 07: PROCEEDINGS OF THE 2007 ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2007, : 105 - 111
  • [40] Designing MPI Library with On-Demand Paging (ODP) of InfiniBand: Challenges and Benefits
    Li, Mingzhe
    Hamidouche, Khaled
    Lu, Xiaoyi
    Subramoni, Hari
    Zhang, Jie
    Panda, Dhabaleswar K.
    SC '16: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2016, : 433 - 443