DHP: Reduce the number of candidates A k-itemset whose corresponding hashing bucket count is below the threshold cannot be frequent Candidates: a, b, c,d,e Hash entries: ab, ad ae tbd, be de] Frequent 1-itemset: a, b d, e ab is not a candidate 2-itemset if the sum of count of fab, ad ae is below support threshold 1. Park, m, chen and p yu, an effective hash-based algorithm for mining association rules. In SIGMOD95 February 4, 2021 Data Mining: Concepts and Techniques 21February 4, 2021 Data Mining: Concepts and Techniques 21 DHP: Reduce the Number of Candidates ◼ A k-itemset whose corresponding hashing bucket count is below the threshold cannot be frequent ◼ Candidates: a, b, c, d, e ◼ Hash entries: {ab, ad, ae} {bd, be, de} … ◼ Frequent 1-itemset: a, b, d, e ◼ ab is not a candidate 2-itemset if the sum of count of {ab, ad, ae} is below support threshold ◼ J. Park, M. Chen, and P. Yu. An effective hash-based algorithm for mining association rules. In SIGMOD’95