Answer to Question #182077 in Programming & Computer Science for Nourah

Question

Q2. The following table represents hypothetical transactions, where each transaction contains set of items (itemset) T, whereT⊆I,andI={A,B,C,D,E,F}. (Marks 3)

Accordingly, apply Aproiri Algorithm on the given data to find:

1. Find all the frequent itemset-1that meet a minimum Support of 3.

2. The association rules, in the form of (LHS➔RHS), from the frequent itemset-1 {A->B}, {B->E}

{A->E} with minimum confidence of 60%.

Answer 1

Dear Nourah, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order