{'fraction_non_alphanumeric': 0.014616321559074299, 'fraction_numerical': 0.0, 'mean_word_length': 5.180451127819549, '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}}
Using appropriate number of computing nodes for parallel mining of frequent patterns

Frequent pattern mining has attracted a lot of attention in past twenty years because of its wide applications like commercial promotion, web search engines, and so forth. However, the execution performance suffers from the rapid growth on the database. Many of the past studies tried to use distributed computing technology to speed up the mining process, but few of them discussed how the appropriate number of computing nodes are located. In this paper, we will propose a novel method named FLB-Mining that is able to effectively determine appropriate number of computing nodes for mining the frequent itemsets. Through empirical evaluations, the proposed method is shown to deliver excellent performance in terms of execution time.