Questions?

Conclusions:

  • New algorithm for maximal frequent itemset discovery

  • Implementation details matter a lot

  • All these algorithms are CPU-bound, minimizing the number of “database scans” is not the right metric

Future work:

  • Closed itemsets

  • Better understanding of the performance through workload measurements

  • Cache-conscious data mining algorithms

Long Description:

Slide Links:

Slide Comments:

Text-Only Version Text-Mostly Version Graphic Version