QUESTION $3($Association Rule Mining$)$

$[$TOTAL MARKS: $25]$

This question uses Appendix $3,$ which contains a list of airport codes. For example, Dublin airport is DUB and De Gaulle airport is CDG$.$ The list represents the minimum support for numbers of evening flights landing at these airports.

Apply the Apriori algorithm to determine the itemsets that exceed a threshold confidence. The table in Appendix $3$ is regarded as the set $\backslash (\backslash$mathrm$\{$C$\}\_\{1\}\backslash ).$

Begin by selecting $9$ airports $($you choose the $9$ airports!$)$ which exceed the minimum support and form the set $\backslash ($ L$\_\{1\}\backslash ).$

Write the set $\backslash (\backslash$mathrm$\{$L$\}\_\{1\}\backslash )($as selected by you$)$ in your answer book.

This is important. You are making the decisions as to which itemsets are supported. Choose your itemsets so that when the time comes, $\backslash (\backslash$mathrm$\{$C$\}\_\{4\}\backslash )$ has at least $1$ item!

Q $3($a$)$

Generate and write the set $\backslash (\backslash$mathrm$\{$C$\}\_\{2\}\backslash )$ into your answer book.

$[3$ Marks$]$

Q $3($b$)$

$[2$ Marks$]$

Now select $8$ itemsets from $\backslash (\backslash$mathrm$\{$C$\}\_\{2\}\backslash )($you choose this set!$)$ which exceed the minimum support and form the set $\backslash ($ L$\_\{2\}\backslash ).$

Write the set $\backslash ($ L$\_\{2\}\backslash )$ in your answer book.

Q $3($c$)$

$[10$ Marks$]$

Generate and write the set $\backslash (\backslash$mathrm$\{$C$\}\_\{3\}\backslash )$ into your answer book. Clearly explain the optimisation process used in the construction on $\backslash (\backslash$mathrm$\{$C$\}\_\{3\}\backslash ).$

Q $3($d$)$

$[10$ Marks$]$

From now on$,$ assume that all itemsets of size $3$ and above are supported.

Run the Apriori algorithm to completion and clearly show what is happening at each step.

Explain how the algorithm terminates. Appendix $3$: Support for Airports