Mining Frequent Itemsets Using Re-Usable Data Structure

- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of structures that could be produced through the execution of the algorithm or from the problem of the processing time in either projecting or decomposing the datasets. Moreover, the constructed structure cannot be re-used in ad-hoc mining queries or in other mining processes. In this paper, the ItemSet Tree (IST) structure is used in effectively counting the itemsets' support to overcome the above limitations. To speedup the support counting process, a proposal for using a Guidance Information Bits and tree size reduction is presented. The TDF algorithm will be proposed to find all the frequent itemsets. TDF explores the frequent itemsets search space in depth-first to generate candidates from the search space and count their support in the IST. Several experiments have been conducted to study the performance o...

• Type: Conference
• Year: 2007
• Where: DMIN
• Authors: Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
• Keywords: Data Mining, DMIN 2007, Frequent Itemsets, Mining Frequent Itemsets, TDF Algorithm