An algorithm frequently mines a set of items for big data to enhance efficiency

In the landscape of rapidly expanding data streams, deriving meaningful insights, particularly frequent itemsets, within massive datasets at a swift pace poses a significant challenge. Addressing this challenge, various methodologies for Frequent Itemset Mining have been proposed, yet they struggle with low support counts and efficiency concerns in handling large datasets. In response, our research introduces Jagged Itemset Counting (JIC) methodologies, aiming to effectively mine Frequent Itemsets from extensive data. The core objective revolves around devising a robust algorithm capable of identifying all Frequent Itemsets, irrespective of database size or the nature of the itemset. Central to this approach is the introduction of a straightforward label representation, GPLN (Geometric Progression Label Number), assigned to each frequent item. Utilizing CGPLN (Cumulative Geometric Progression Label Number), derived from the arithmetic sum of GPLNs within transaction subsets, forms the CGPLN-Label representation for each transaction subset (itemset). Comparative analysis reveals superior performance of JIC over Apriori and Eclat algorithms for small and medium-sized datasets, exhibiting efficiency even at minimal support thresholds. In the realm of Big Data, where FP-Growth and Eclat falter, the proposed technique shines with faster execution times, optimized main memory utilization, and efficient disc memory usage.