DHP: Implementation

J.-S. Park, M.-S. Chen and P. S. Yu, ``An Effective Hash Based Algorithm for Mining Association Rules,'' Proc. of ACM SIGMOD, May 23-25, 1995, pp. 175-186.

Srikant’s Data Generation, or link here. (T10.I4.D100, N=1000)

Reports to be handed in:

1.         Execution time versus minimum support for 1%, 0.75%, 0.5%, 0.25%, 0.1%.

2.         Number of candidates for L1, C2, L2, C3, L3, …, C6, L6 versus minimum support for 1%, 0.5%, 0.2%, 0.1%. (Table 2)

3.         The remaining number of transactions in each pass. (Figure 10)

4.         The average number of items in a transaction in each pass. (Figure 11)

5.         Execution time versus data size (D100, D250, D500, D750, D1000). (Figure 12)