st ID TID items bought (in the form of brand-item category) 01 T100 {King’s-Crab, Sunset-Milk, Dairyland-Cheese, Best-Bread} 02 T200 {Best-Cheese, Dairyland-Milk, Goldenfarm-Apple, Tasty-Pie, Wonder-Bread} 01 T300 {Westcoast-Apple, Dairyland-Milk, Wonder-Bread, Tasty-Pie} 03 T400 {Wonder-Bread, Sunset-Milk, Dairyland-Cheese} (a) At the granularity of item category (e.g., itemi could be “Milk”), for the rule template, ∀X ∈ transaction, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3) [s,c], list the frequent k-itemset for the largest k, and all the strong association rules (with their support s and confidence c) containing the frequent k-itemset for the largest k. (b) At the granularity of brand-item category (e.g.
A
cust ID TID items bought (in the form of brand-item category)
01 T100 {King’s-Crab, Sunset-Milk, Dairyland-Cheese, Best-Bread}
02 T200 {Best-Cheese, Dairyland-Milk, Goldenfarm-Apple, Tasty-Pie, Wonder-Bread}
01 T300 {Westcoast-Apple, Dairyland-Milk, Wonder-Bread, Tasty-Pie}
03 T400 {Wonder-Bread, Sunset-Milk, Dairyland-Cheese}
(a) At the granularity of item category (e.g., itemi could be “Milk”), for the rule
template,
∀X ∈ transaction, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3) [s,c],
list the frequent k-itemset for the largest k, and all the strong association rules
(with their support s and confidence c) containing the frequent k-itemset for the
largest k.
(b) At the granularity of brand-item category (e.g., itemi could be “Sunset-Milk”),
for the rule template,
∀X ∈ customer, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3),
list the frequent k-itemset for the largest k (but do not print any rules).
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
