{'fraction_non_alphanumeric': 0.01049618320610687, 'fraction_numerical': 0.003816793893129771, 'mean_word_length': 5.55625, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Application of improved Apriori in University Library

Data mining is a process of extracting previously unknown, valid and actionable information from large database or data warehouse and then using information so derived to make crucial business and strategic decisions. In data mining, Apriori is a classic algorithm for learning association rules. Agrawal put forth association rules in 1993 and introduced the famous Apriori algorithm. The objective of this research is to improve the efficiency of Apriori Algorithm. The paper discusses and analyzes Apriori algorithm for mining association rules and introduces means to improve the efficiency of algorithm. It also discusses the implementation details of this algorithm and its application in University Library. This paper proposes two algorithms Apriori Algorithm and Improved Apriori Algorithm to significantly reduce the disk I/O operations and hence improve the efficiency of Apriori Algorithm. The aforesaid algorithms will be implemented through the Book Recommendation Service Model.