A novel algorithm for frequent itemsets mining in transactional databases

Abstract

Since the era of data explosion, data mining in transactional databases has become more and more important. There are many data mining techniques like association rule mining, the most important and well-researched one. Furthermore, frequent itemset mining is one of the fundamental but time-consuming steps in association rule mining. Most of the algorithms used in literature find frequent itemsets on search space items having at least a minsup and are not reused for mining next time. To deal with this problem, NOV-FI algorithms are proposed as a new approach in order to quickly detect frequent itemsets from transactional databases using an array of co-occurrences and occurrences of kernel item in at least one transaction. NOV-FI algorithms are easily expanded in distributed systems. Finally, the experimental results show that the proposed algorithms perform better than other existing algorithms.