Depth First Search: Remarks

• We prune frequent itemsets and avoid counting them (works only for maximal frequent itemsets)

• To find an itemset with k items, we need to count k prefixes