{'fraction_non_alphanumeric': 0.01468048359240069, 'fraction_numerical': 0.0, 'mean_word_length': 5.197860962566845, '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}}
Set and array based hybrid data structure solution for Frequent Pattern Mining

The problem of Frequent Pattern Mining has been widely studied in the literature because of its numerous applications to a variety of data mining problems such as clustering and classification. In this paper, a new vertical format mining algorithm HybridDSItr has been proposed. The algorithm uses a hybrid data structure HybridDS to store the dataset in a compact fashion. It uses an iterative procedure to reduce intermediate candidate generation and save memory and time. Experimental studies have been performed to compare the new algorithm with the (trie based) FP-Growth algorithm and the (vertical format based) Eclat algorithm. The experimental results confirm following observations for sparse datasets. The algorithm exhibits better performance in terms of time as compared to both Eclat and FP-Growth algorithms. It exhibits better performance in terms of memory as compared to FP-Growth and similar or better performance than Eclat algorithm. This new approach can be applied to improve memory and time efficiency of existing vertical format based mining algorithms.