Scribd
Upload
837 views1 page

A Database Has Five Transactions

This document contains a database with 5 transactions and items bought by customers. It asks to (a) find all frequent itemsets using Apriori and FP-growth algorithms and compare their efficiency, and (b) list all strong association rules that match the given metarule with support and confidence thresholds provided.

Uploaded by

JagadeesanSrinivasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
837 views1 page

A Database Has Five Transactions

This document contains a database with 5 transactions and items bought by customers. It asks to (a) find all frequent itemsets using Apriori and FP-growth algorithms and compare their efficiency, and (b) list all strong association rules that match the given metarule with support and confidence thresholds provided.

Uploaded by

JagadeesanSrinivasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

A database has five transactions.

Let min sup = 60% and min conf =


80%.
TID items bought
T100 {M, O, N, K, E, Y}
T200 {D, O, N, K, E, Y }
T300 {M, A, K, E}
T400 {M, U, C, K, Y}
T500 {C, O, O, K, I ,E}
(a) Find all frequent itemsets using Apriori and FP-growth, respectively.
Compare the efficiency of thetwo mining processes.
(b) List all of the strong association rules (with support s and confidence
c) matching the followingmetarule, where X is a variable representing
customers, and itemi denotes variables representingitems (e.g., “A”,
“B”, etc.):∀x ∈ transaction, buys(X, item1) ∧ buys(X, item2) ⇒ buys(X,
item3) [s, c]

You might also like