Finding the base of global implications for the association rule problem

Using concept lattices as a theoretical background for finding association rules [1] has led to designing algorithms like Charm [2], Close [3] or Closet [4]. 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.