{'fraction_non_alphanumeric': 0.018376722817764167, 'fraction_numerical': 0.0030627871362940277, 'mean_word_length': 4.839285714285714, '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}}
A Comparison of Apriori Algorithm and Apriorib with Hashing Algorithm

Data mining helps us in finding a pattern or some information that can help us relate different items even in a very big dataset. Association mining rules is one of the best applications of data mining that helps us in finding frequent itemsets [1]. Apriori algorithm is an algorithm that helps us find these similarities between different items using concepts of lift, support and confidence. This paper discusses about apriori algorithm, how it works, what are its advantages, disadvantages and how it can be made better and efficient with the help of data structure hash map [4].