Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

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. SIGMOD’95

Speaker notes:

Content Tools


There are currently no sources for this slide.