![]() ![]() In: Proceeding of the VLDB’94, pp 487–499Īgrawal R, Srikant R (1995) Mining sequential patterns. In: Proceeding of the SIGMOD’93, pp 207–216Īgrawal R, Srikant R (1994) Fast algorithms for mining association rules. The experimental results show that NSFI outperforms PrePost in terms of runtime and memory usage and outperforms dEclat in terms of runtime.Īgrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. Using the subsume index, NSFI can identify groups of frequent itemsets without determining the N-list associated with them. Furthermore, two new theorems are proposed for determining the “subsume index” of frequent 1-itemsets based on the N-list concept. This paper proposes an improved version of PrePost, the N-list and Subsume-based algorithm for mining Frequent Itemsets (NSFI) algorithm 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. Recently the PrePost algorithm, a new algorithm for mining frequent itemsets based on the idea of N-lists, which in most cases outperforms other current state-of-the-art algorithms, has been presented. Frequent itemset mining is a fundamental element with respect to many data mining problems directed at finding interesting patterns in data. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |