Abstract -Frequent itemset mining is a fundamental element with respect to many data mining problems. Recently, the PrePost algorithm has been proposed, a new algorithm for mining frequent itemsets based on the idea of N-lists. PrePost in most cases outperforms other current state-of-the-art algorithms. In this paper, we present an improved version of PrePost that uses a hash table to enhance the process of creating the N-lists associated with 1-itemsets and an improved N-list intersection algorithm. Furthermore, two new theorems are proposed for determining the "subsume index" of frequent 1-itemsets based on the N-list concept. The experimental results show that the performance of the proposed algorithm improves on that of PrePost.
A hybrid algorithm based on PrePost proposed by Vo et al. REF , An improved PrePost algorithm uses a hash table to enhance the process of creating the N-lists data structure.
A Hybrid Approach for Mining Frequent Itemsets
2013 IEEE International Conference on Systems, Man, and Cybernetics
2013 IEEE International Conference on Systems, Man, and Cybernetics
Computer Science