Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
A database has four transactions, given below, TID Date items_bought T10 1/10/2021 {K, A, D, B} T20 1/11/2021 {D, A, C, E, B} T30 2/1/2021 {C, A, B, E} T40 2/3/2021 {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 (Ci) and acceptable frequent itemsets (Li). (b) List all of the strong association rules, along with their support and confidence values

A database has four transactions, given below, TID Date items_bought T10 1/10/2021 {K, A, D, B} T20 1/11/2021 {D, A, C, E, B} T30 2/1/2021 {C, A, B, E} T40 2/3/2021 {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 (Ci) and acceptable frequent itemsets (Li). (b) List all of the strong association rules, along with their support and confidence values

A Guide to SQL
A Guide to SQL
9th Edition
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Philip J. Pratt
Chapter2: Database Design Fundamentals
Section: Chapter Questions
Problem 11RQ
See similar textbooks
icon
Related questions
Question

6

Data Mining

Language R

A database has four transactions, given below,

TID

Date

items_bought

T10

1/10/2021

{K, A, D, B}

T20

1/11/2021

{D, A, C, E, B}

T30

2/1/2021

{C, A, B, E}

T40

2/3/2021

{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 (Ci) and acceptable frequent itemsets (Li).

(b) List all of the strong association rules, along with their support and confidence values.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Dataset
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
A Guide to SQL
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781285196145
Author:
Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS