Not Logged In

Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint

Full Text: ideas03-2.pdf PDF

In this paper, we propose a novel data structure called CATS Tree. CATS Tree extends the idea of FPTree to improve storage compression and allow frequent pattern mining without generation of candidate item sets. The proposed algorithms enable frequent pattern mining with different supports without rebuilding the tree structure. Furthermore, the algorithms allow mining with a single pass over the database as well as efficient insertion or deletion of transactions at any time.

Citation

W. Cheung, O. Zaiane. "Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint". International Database Engineering and Applications Symposium, Hong Kong, China, pp 111-116, July 2003.

Keywords:  
Category: In Conference

BibTeX

@incollection{Cheung+Zaiane:IDEAS03,
  author = {William Cheung and Osmar R. Zaiane},
  title = {Incremental Mining of Frequent Patterns Without Candidate Generation
    or Support Constraint},
  Pages = {111-116},
  booktitle = { International Database Engineering and Applications Symposium},
  year = 2003,
}

Last Updated: February 04, 2020
Submitted by Sabina P

University of Alberta Logo AICML Logo