{'fraction_non_alphanumeric': 0.023622047244094488, 'fraction_numerical': 0.0, 'mean_word_length': 4.878612716763006, '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}}
FP-NoSQL: An Efficient Frequent Itemset Mining Algorithm Using the FP-DB Approach

One of the most favoured abilities of Information Technology (IT) among many Chief Executive Officials (CEOs) is data analytics. This is because it helps to increase the revenue, cut the cost, and gain more competitive advantage for their companies in the challenging business market. However, the hidden patterns of the frequent itemsets become more time consuming to be analysed when the amount of data is big in a data set. Furthermore, it also causes a large memory consumption for mining the hidden patterns of the frequent itemsets because of the heavy computation by the algorithm. Therefore, this research proposes FP-NoSQL as an efficient algorithm for Frequent Itemset Mining using the Not Only Structure Query Language (NoSQL) in a Frequent Pattern Database (FP-DB). The algorithm is capable of mining the hidden patterns of the frequent itemsets within a shorter run time although the amount of data is big in a data set.