A Markov logic network method for reconstructing association rule-mining tasks in library book recommendation. Issue 1 (5th May 2021)

• Record Type: Journal Article
• Authors: Wang, Shanshan; Xu, Jiahui; Feng, Youli; Peng, Meiling; Ma, Kaijie
• Is Part Of: Information discovery and delivery. Volume 50:Issue 1(2022)
• Page Start: 34
• Page End: 44
• Publication Date: 2021-05-05
• Subjects: Decision-making -- Association rule -- Data mining -- Library recommendation; Information retrieval -- Periodicals; Document delivery -- Periodicals; Digital libraries -- Periodicals; Information storage and retrieval systems -- Periodicals; 025.524
• DOI: 10.1108/IDD-09-2020-0110
• Languages: English
• ISSNs: 2398-6247

Abstract

Abstract : Purpose: This study aims to overcome the problem of traditional association rules relying almost entirely on expert experience to set relevant interest indexes in mining. Second, this project can effectively solve the problem of four types of rules being present in the database at the same time. The traditional association algorithm can only mine one or two types of rules and cannot fully explore the database knowledge in the decision-making process for library recommendation. Design/methodology/approach: The authors proposed a Markov logic network method to reconstruct association rule-mining tasks for library recommendation and compared the method proposed in this paper to traditional Apriori, FP-Growth, Inverse, Sporadic and UserBasedCF algorithms on two history library data sets and the Chess and Accident data sets. Findings: The method used in this project had two major advantages. First, the authors were able to mine four types of rules in an integrated manner without having to set interest measures. In addition, because it represents the relevance of mining in the network, decision-makers can use network visualization tools to fully understand the results of mining in library recommendation and data sets from other fields. Research limitations/implications: The time cost of the project is still high for large data sets. The authors will solve this problem by mapping books, items, or attributes to higher granularity to reduce the computational complexity in the future. Originality/value: The authors believed that knowledge of complex real-world problems can be well captured from a network perspective. This study can help researchers to avoid setting interest metrics and to comprehensively extract frequent, rare, positive, and negative rules in an integrated manner.