min_conf = 80%: (a) Find all frequent itemsets (not just the ones with the maximum width/length) using the Apriori algorithm. Show your work—just showing the final answer is not acceptable. For each iteration show the candidate and acceptable frequent itemsets. You should show your work similar to the way the example was done in the PowerPoint slides. (b)List all of the strong association rules, along with their support and confidence values, whichmatch the following metarule, where X is a variable representing customers and itemi denotes variables representing items (e.g., “A”, “B”, etc.). x  transaction, buys(X, item1)  buys(X, item2)  buys(X, item3) Hint: don’t worry about the fact that the statement above uses relations. The point of the metarule is to tell you to only worry about association rules of the form X  Y  Z (or {X, Y}  Z if you prefer that notation). That is, you don’t need to worry about rules of the form X  Z.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

A database has 4 transactions, shown below.
TID Date items_bought
T100 10/15/04 {K, A, D, B}
T200 10/15/04 {D, A, C, E, B}
T300 10/19/04 {C, A, B, E}
T400 10/22/04 {B, A, D}
Assuming a minimum level of support min_sup = 60% and a minimum level of
confidence
min_conf = 80%:
(a) Find all frequent itemsets (not just the ones with the maximum width/length) using 
the Apriori algorithm. Show your work—just showing the final answer is not 
acceptable. For each iteration show the candidate and acceptable frequent itemsets. 
You should show your work similar to the way the example was done in the
PowerPoint slides.
(b)List all of the strong association rules, along with their support and confidence 
values, whichmatch the following metarule, where X is a variable representing 
customers and itemi denotes variables representing items (e.g., “A”, “B”, etc.).
x  transaction, buys(X, item1)  buys(X, item2)  buys(X, item3)
Hint: don’t worry about the fact that the statement above uses relations. The point of 
the metarule is to tell you to only worry about association rules of the form X  Y 
 Z (or {X, Y}  Z if you prefer that notation). That is, you don’t need to worry 
about rules of the form X  Z.

 

Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Data Modeling Concepts
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education