Let D be a set of transactions, where each transaction T is a
set of items such that T I, I= {i1, i2,…..im} be a set of literals,
called items. Given the set of transactions D the problem is to
find association rules that have support and confidence greater
than the user specified minimum support and minimum
confidence [8].