Các bài báo công bố quốc tế
Bay Vo, Tuong Le, Frans Coenen, Tzung-Pei Hong; A hybrid approach for mining frequent itemsets; International Conference on Systems, Man, and Cybernetics, pp. 4647 – 4651 (Conference).
Frequent item set 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 item sets 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.