a ⟾ b where b is 1 item 2^ |i| possible subsets of items i there are 3 ^ |i| - 2 ^ |i| + 1 possible assoc rules
a ⟾ b where b is 1 item 2^ |i| possible subsets of items i there are 3 ^ |i| - 2 ^ |i| + 1 possible assoc rules
• association rule r : itemset1 =&gt; itemset2 • itemset1, itemset2 are disjoint and • itemset2 is non-empty • simplified definition: itemset2 has only one item