Providing lower bound for the support in apriori Algorithm

Question

Suppose in a market basket scenario, the following association rules are detected with a support of at least 15% and a confidence of at least 60%:

{A, B} → {C} {B, C} → {D}

How accurately can you present a lower bound for the support of the itemset {A, B, C, D}?

Can anyone help me understand what is the lower bound I am looking here at in the apriori algorithm ?

score 0 · Answer 1 · answered Dec 09 '17 at 18:53

0

Break this down into two steps. What is the minimum support of ABC?

Then, what is the minimum support of ABCD?

answered Dec 09 '17 at 18:53

Oh, but how do I calculate the minimum support of ABC ? Any pointers on what is the minimum support of ABC ? – Sukant Mohapatra Dec 10 '17 at 13:30
See the definition of confidence. – Has QUIT--Anony-Mousse Dec 10 '17 at 17:23

1 Answers1