Question: Problem 2 (25 points): A database has four transactions. Let min sup = 60% and min conf = 80%. cust_ID TID items_bought (in the form

Problem 2 (25 points): A database has four
Problem 2 (25 points): A database has four transactions. Let min sup = 60% and min conf = 80%. 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} At the granularity of item category (e.g., item i could be "Milk"), for the following rule template, V X E transaction, buys(X, item 1 ) A buys(X, item 2 ) = buys(X, item 3 ) [s, c] list the frequent k-itemset for the largest k, and all of the strong association rules (with their support s and confidence c) containing the frequent k-itemset for the largest k

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!