big data
Budget: $10 – $30 CAD
Suppose the items are numbered 1 to 10, and each basket is constructed by including item i with probability
1/i, each decision being made independently of all other decisions. That is, all the baskets contain item 1,
half contain item 2, a third contain item 3, and so on. Assume the number of baskets is sufficiently large that
the baskets collectively behave as one would expect statistically. Let the support threshold be 1% of the
baskets.
1. Find the frequent itemsets.
2. Prove that in this data there are no interesting association rules, i.e., the interest of every
association rule is 0.
1/i, each decision being made independently of all other decisions. That is, all the baskets contain item 1,
half contain item 2, a third contain item 3, and so on. Assume the number of baskets is sufficiently large that
the baskets collectively behave as one would expect statistically. Let the support threshold be 1% of the
baskets.
1. Find the frequent itemsets.
2. Prove that in this data there are no interesting association rules, i.e., the interest of every
association rule is 0.