HYBRID: an efficient unifying process to mine frequent itemsets

Current advancement in technology inexorably leads to data flood. More data is generated from banking, telecom, scientific experiments, etc. Data mining is the process of extracting useful information from this flooded data, which helps in making profitable future decisions in these fields. Frequent itemset mining is one of the focus research areas and an important step to fin association rules. Time and space requirements for generating frequent itemsets are of utter importance. Algorithms to mine frequent itemsets effectively help in finding association rules and also help in many other data mining tasks. In this paper, an efficient hybrid algorithm was designed using a unifying process of the algorithms Improved Apriori and FP-Growth. Results indicate that the proposed hybrid algorithm, albeit more complex, consumes fewer memory resources and faster execution time