Data Warehousing and Data Mining207610 marksNumerical: Association rules miningLimitation and improving Apriori
List the problems of Apriori algorithm with its possible solutions. Consider the following transaction dataset. What association rules can be found in this set, if the minimum support is 3 and the minimum confidence is 80%? | Transaction_ID | Item_List | |---|---| | T1 | {K, A, D, B} | | T2 | {D, A,
List the problems of Apriori algorithm with its possible solutions. Consider the following transaction dataset. What association rules can be found in this set, if the minimum support is 3 and the minimum confidence is 80%?
| Transaction_ID | Item_List |
|---|---|
| T1 | {K, A, D, B} |
| T2 | {D, A, C, E, B} |
| T3 | {C, A, B, E} |
| T4 | {B, A, D} |
[10]
- Huge number of candidate itemsets. At each level Apriori generates many candidates. For example, $10^4$ frequent 1-itemsets produce roughly $\binom{10^4}{2}\approx 5\times10^7$ candidate 2-itemsets. 2. Multiple database scans. The full database must be scanned once for every level $k$, causing...