Not Logged In

On Frequent Itemset Mining with Closure

Full Text: icit05.pdf PDF

Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of data mining. Although many efficient frequent-pattern mining techniques have been developed in the last decade, most of them assume relatively small databases in the order of tens or hundreds of thousands of transactions, leaving extremely large but realistic datasets, with millions of transactions, out of reach. A practical and appealing direction is to mine for closed or maximal itemsets. These are subsets of all frequent patterns but good representatives since they eliminate what is known as redundant patterns. The practicality of discovering closed or maximal itemsets comes from the relatively inexpensive process to mine them in comparison to finding all patterns. In this paper we introduce a new approach for traversing the search space to discover all frequent patterns, the closed or the maximal patterns efficiently in extremely large datasets. We present experimental results for finding all three types of patterns with very large database sizes never reported before. Our implementation tested on real and synthetic data shows that our approach outperforms similar state-of the-art algorithms by at least one order of magnitude in terms of both execution time and memory usage, in particular when dealing with very large datasets.

Citation

M. El-Hajj, O. Zaiane. "On Frequent Itemset Mining with Closure". International Conference on Information Technology (ICIT), Amman, Jordan, (ed: Al-Dahoud Ali), pp 21-30, May 2005.

Keywords: Database and Data Mining, Frequent Pattern Mining, Frequent Itemsets, Closed Patterns, Lattice Traversal
Category: In Conference
Web Links: Webdocs

BibTeX

@incollection{El-Hajj+Zaiane:ICIT05,
  author = {Mohammad El-Hajj and Osmar R. Zaiane},
  title = {On Frequent Itemset Mining with Closure},
  Editor = {Al-Dahoud Ali},
  Pages = {21-30},
  booktitle = {International Conference on Information Technology (ICIT)},
  year = 2005,
}

Last Updated: January 31, 2020
Submitted by Sabina P

University of Alberta Logo AICML Logo