Keeping things simple: finding frequent item sets by recursive elimination

Abstract

Recursive elimination is an algorithm for finding frequent item sets, which is strongly inspired by the FP-growth algorithm and very similar to the H-mine algorithm. It does its work without prefix trees or any other complicated data structures, processing the transactions directly. Its main strength is not its speed (although it is not slow, even… (More)
DOI: 10.1145/1133905.1133914

Topics

7 Figures and Tables

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics