Finding the base of global implications for the association rule problem
ABSTRACT Using concept lattices as a theoretical background for finding association rules has led to designing algorithms like CHARM (Zaki and Hsiao (1999)), CLOSE (Pasquier, Bastide, Taouil, and Lakhal (1999)) or CLOSET (Pei, Han, and Mao (2000)). While they are considered as extremely appropriate when finding concepts for association rules, they do not cover a certain area of significant results, namely the pseudo-intents that form the base for global implications. We propose an approach that, besides finding all proper partial implications, also finds the pseudo-intents. The way our algorithm is devised, it allows certain important operations on concept lattices, like adding or extracting items, meaning we can reuse previously found results.