Hash in Action

Efficient Support Counting

Tan's textbook: pps. 375 - 377

a straightforward approach: slide #31

a more efficient approach using hash trees: slides

#32 - #38
There is a mistake on slide #38 in
Tan_C5_Association.pptx  (Unit 9 - 3/26/2020) in
Canvas

April 24, 2020 Chapter 3 Aux Notes 1

 Hash in Action (cont.)
Building the hash tree from candidates
 On page 377 of Professor Tan's textbook, there is the following:
 5 out of the 9 leaf nodes are visited and

 9 out of the 15 itemsets are compared against the

transaction.
and the above is correct.
 However, on slide #38:
 6 out of the 9 leaf nodes are visited and

 1 out of the 15 itemsets are compared against the

transaction
which is wrong.

April 24, 2020 Chapter 3 Aux Notes 2

 Hash in Action (cont.)
Nice annotations by Chih-Ling Hsu:
https://chih-ling-hsu.github.io/2017/03/25/apriori
https://chih-ling-hsu.github.io/2017/03/25/generate-a-
candidate-hash-tree
https://chih-ling-hsu.github.io/2017/03/25/generate-a-
candidate-hash-tree#subset-operation-using-hash-tree

Slides also available directly from Prof. Kumar's web

site:
   https://www-
users.cs.umn.edu/~kumar001/dmbook/slides/chap5-
association_analysis.pptx

April 24, 2020 Chapter 3 Aux Notes 3

 Hash in Action (cont.)
The box "1 2 5; 4 5 8" is visited is due to the following: there
is the box
    [ 1 2 + | 3 5 6 ]
near the upper left corner of the diagram.  From that box, <1
2 5> is generated and that leads to the visit of the box
"1 2 5; 4 5 8“

On the right side, it appears that 

     [ 3 + | 5 6 ]
eventually leads to the box "3 6 7; 3 6 8".  However, the
only reasonable 3-itemset from
     [ 3 + | 5 6 ]
is "3 5 6" so the box "3 5 6; 3 5 7; 6, 8, 9" is visited but not
"3 6 7; 3 6 8"

April 24, 2020 Chapter 3 Aux Notes 4

April 24, 2020 Chapter 3 Aux Notes 5
April 24, 2020 Chapter 3 Aux Notes 6
April 24, 2020 Chapter 3 Aux Notes 7
April 24, 2020 Chapter 3 Aux Notes 8
April 24, 2020 Chapter 3 Aux Notes 9
April 24, 2020 Chapter 3 Aux Notes 10