Not Logged In

Implementing Leap Traversals of the Itemset Lattice

Full Text: osdm05.pdf PDF

The Leap-Traversal approach consists of traversing the item-set lattice by deciding on carefully selected nodes and avoiding systematic enumeration of candidates. We propose two ways to implement this approach. The first one uses a simple header-less frequent pattern tree and the second one partitions the transaction space using COFI-trees. In this paper we discuss how to avoid nodes in the lattice that would not participate in the answer set and hence drastically reduce the number of candidates to test out. We also study the performance of HFP-Leap and COFI-Leap in comparison with other algorithms.

Citation

M. El-Hajj, O. Zaiane. "Implementing Leap Traversals of the Itemset Lattice". Open Source Data Mining Workshop on Frequent Pattern Mining Implementations (OSDM), ACM, pp 16-25, August 2005.

Keywords:  
Category: In Workshop

BibTeX

@misc{El-Hajj+Zaiane:OSDM05,
  author = {Mohammad El-Hajj and Osmar R. Zaiane},
  title = {Implementing Leap Traversals of the Itemset Lattice},
  Publisher = "ACM",
  Pages = {16-25},
  booktitle = {Open Source Data Mining Workshop on Frequent Pattern Mining
    Implementations (OSDM)},
  year = 2005,
}

Last Updated: February 04, 2020
Submitted by Sabina P

University of Alberta Logo AICML Logo