Mining frequent item sets by opportunistic projection


In this paper, we present a novel algorithm Opportune Project for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm is fundamentally different from those proposed in the past in that it opportunistically chooses between two different structures, array-based or tree-based, to represent projected… (More)
DOI: 10.1145/775047.775081


18 Figures and Tables


Citations per Year

192 Citations

Semantic Scholar estimates that this publication has 192 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics