On a parallel spark workflow for frequent itemset mining based on array prefix-tree

Keyphrases

• Frequent Pattern Mining 100%
• Prefix Tree 100%
• FP-Growth 100%
• Adaptive Algorithm 66%
• Mining Method 66%
• Algorithm Selection 66%
• Parallelizing 33%
• Array Structure 33%
• High Time 33%
• Selection Strategy 33%
• Time Performance 33%
• Time Complexity 33%
• Multiple Datasets 33%
• State-of-the-art Techniques 33%
• Memory Consumption 33%
• Memory Time 33%
• Performance Issues 33%
• Auxiliary Structure 33%
• Frequent Itemsets 33%
• Changing Points 33%
• Pattern Database 33%
• Tree Growth 33%
• Density Threshold 33%

Computer Science

• Frequent Itemsets 100%
• Prefix Tree 100%
• Algorithm Selection 66%
• Adaptive Algorithm 66%
• Data Mining 33%
• Experimental Result 33%
• Large Data Set 33%
• Time Performance 33%
• Time Complexity 33%
• Selection Process 33%
• Performance Issue 33%
• Density Threshold 33%
• Pattern Database 33%