A COMPARATIVE STUDY OF FREQUENT ITEMSET MINING ALGORITHMS

Data mining has a great role for making market revenue by its decisive quality. Frequent Itemsets Mining (FIM) is very focused and emerging field of research of data mining. .FIM is used in association rule mining and other data analytic tasks. Frequent itemsets are patterns those occur very frequently in dataset. This paper provides efficacious and in-depth study of FIM algorithms. A comparative study of existing FIM algorithms and their variations are analyzed to find the limitations of these algorithms. Apriori ,Fp Growth, Eclat are basic methodologies for Frequent itemset mining. But there is issue for efficiency and memory consumption. Initially FIM was started in 1990’s and first algorithm, Apriori has drawback of scanning database multiple time, so complexity and memory consumption was high. Then Fp-Growth algorithm required scanning of dataset twice to form Fp-tree so huge memory consumption was required to hold the fp tree for Frequent Itemset Mining. After it Parallel frequent mining (shared and non-shared memory) overcome the drawback of FP-Growth algorithms by balancing the workload of single node to achieve efficiency. Now in present era of big dataset with voluminous and growing data at every moment, more prominent, efficient and scalable algorithm is required as complexity of these algorithms exponentially increases with the growth of rapid data .So objective of the study is in-depth literature review of Frequent Itemsets Mining algorithms to develop an efficient FIM algorithm.