Performance Comparison with DP

DepthProject (Agarwal, Aggarwal, Prasad; KDD 2000)

    • Same depth-first search strategy

    • Different ways to prune the search space (reordering children)

    • Different implementation (horizontal database representation, very clever way of counting at low levels, similar compression of the set of transactions)

    • We optimized our implementation of DP as much as we optimized MAFIA

Slide Links:

Slide Comments:

Text-Only Version Text-Mostly Version Graphic Version