Data Warehousing and Data Mining208110 marksNumerical: FP growth algorithmFinding frequent itemset
How do you generate strong association rules? From the following dataset find the frequent item set using FP growth algorithm using 3 as minimum support. | Transaction ID | Items | |---|---| | T1 | {K, E, M, O, Y} | | T2 | {K, E, O, Y} | | T3 | {K, E, M} | | T4 | {K, M, Y} | | T5 | {K, E, O} |
How do you generate strong association rules? From the following dataset find the frequent item set using FP growth algorithm using 3 as minimum support.
| Transaction ID | Items |
|---|---|
| T1 | {K, E, M, O, Y} |
| T2 | {K, E, O, Y} |
| T3 | {K, E, M} |
| T4 | {K, M, Y} |
| T5 | {K, E, O} |
[10]
Transactions: - T1: {K, E, M, O, Y} - T2: {K, E, O, Y} - T3: {K, E, M} - T4: {K, M, Y} - T5: {K, E, O} Minimum support = 3 A strong association rule $X \Rightarrow Y$ satisfies both thresholds: - $\text{support}(X \cup Y) \geq \text{min\support}$ -