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.

How to Count Supports of Candidates?

  • Why counting supports of candidates a problem?
    • The total number of candidates can be very huge
    • One transaction may contain many candidates
  • Method:
    • Candidate itemsets are stored in a hash-tree
    • Leaf node of hash-tree contains a list of itemsets and counts
    • Interior node contains a hash table
    • Subset function: finds all the candidates contained in a transaction

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.