Apriori Algorithm (Handwritten Solution Required)

Consider the transactional dataset given in Table 1:

a. Find all frequent itemsets using the Apriori algorithm. Assume minimum support count is 3.

b. Identify all closed frequent patterns.

c. Identify all max frequent patterns.

d. Generate any two strong association rules from any one of the max frequent patterns found in the database. Assume minimum confidence is 70%.

Compute Lift of these two rules and provide interpretation of the resulting lift values.

\begin{tabular}{|l|l|} \hline \multicolumn{2}{|l|}{ Table 1 } \\ \hline TID & Items \\ \hline 1 & ACDE \\ \hline 2 & ABCD \\ \hline 3 & ACDE \\ \hline 4 & DEF \\ \hline 5 & ACDE \\ \hline 6 & DE \\ \hline 7 & E \\ \hline 8 & AEF \\ \hline 9 & DE \\ \hline 10 & AB \\ \hline 11 & ABCDE \\ \hline 12 & BE \\ \hline \end{tabular}