Apriori - algorithm Read in a transactional database. Implement the apriori algorithm:

find the frequencySet with support > 1 with the highest itemset possible - k. Also print out all of the frequencySets for all the itemSet less than k .

So if you find an itemSet of length 3

print out

F[1] . -- all th the frequency sets of ltemset length 1

F[ 2}

F[3]