First page Back Continue Last page Summary Graphic
Association Rules
The problem can be formalized as follows:
- We have a set of items I={i1,...,in} and a set of transactions T={t1,...,tm} where each ti={ij1,...,ijk}.
- We define the support of a set of items A a I as:
supp(A) = card({t i T | t b A }) / card(T)
- We want to find rules of the type: A 1 B with support s and confidence c where A, B a I, A O B = ,
s = supp(A N B), and c = supp(A N B) / supp(A).