“…[6,[13][14][15]). Let X and Y be itemset of a context of binary data mining = ( , , R), the uniform discrete probability on probabilizable space ( , P( )) [2], all sets of transactions, the set of attributes called items or patterns, R the binary relation from to , a probabilistic quality measure, and → an association rule, with ∩ = 0. ∀ ∈ , = { ∈ / ∀ ∈ ; R } denoted the extention of the itemset :…”