Each dataset below contains $10$ items and $10000$ transactions. Dark cells indicate the presence of items

and white $($and grey$)$ cells indicate the absence of items. We will apply the Apriori algorithm to extract

frequent item sets with minsup $=20\%($i$.$e$.$ Itemsets must contain at least $2000$ transactions$).$

$($A$)$

$($B$)$

$($a$)$ Which dataset will produce the largest number of frequent itemsets?

Answer $(\frac{A}{B}\frac{?}{C})$ :

$($b$)$ Which dataset will produce the longest frequent itemset?

Answer $(\frac{A}{B}\frac{?}{C})$ :

$($c$)$ Which dataset will produce frequent itemsets with highest support?

Answer $(\frac{A}{B}\frac{?}{C})$ :

$($d$)$ Which dataset will produce the least number of maximal frequent itemsets?

Answer $($A$/$B$/$C$)$:

$($e$)$ Which dataset will produce the least number of closed itemsets?

Answer $($A$/$B$/$C$)$: