Question: Data Mining Q9. Consider the following binary transaction database, T: T A | B | C | D | E 111 01 1 2 001

Data Mining

Data Mining Q9. Consider the following binary transaction database, T: T A

Q9. Consider the following binary transaction database, T: T A | B | C | D | E 111 01 1 2 001 3 11 01 1 4 10 1 6 01 0 (a) Assume that minimum support count is 5, or minsup - 0.833. At this level of minsup (i) List all candidate 1-itemsets: (ii) List all candidate 2-itemsets: (iii) List all candidate 3-itemsets (b) What is the support for the rule {A,B} - [D)? (c) What is the confidence for the rule in (b)? (d) What is the support for the rule {A,B,C] - {D,E]? (e) What is the confidence for the rule in (d)? (f) Of the rules given in (b) and (d), which rule is more robust (or stable)

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 Databases Questions!