Interactive Mining and Knowledge Reuse for the Closed-Itemset Incremental-Mining Problem Luminita Dumitriu   View Paper (PDF)   Return to January 2002 - Volume 3, Issue 2 Abstract Using concept lattices as a theoretical background for finding association rules has led to designing algorithms like Charm, Close or Closet. While they are considered as extremely appropriate when finding concepts for association rules, due to the smaller amount of results, they do not cover a certain area of significant results, namely the pseudo-intents the form the base for global implications. We have proposed an approach that, besides finding all proper partial implications, also finds 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. It is a well-known fact that mining association rules may lead to a large amount of results. Since, the mining results are meant to be understood by the user, we have come to the conclusion that he will benefit more from starting small, with some of the items in the database, understand a small amount of results, and then add items receiving only the extra-results. This way the number of human interventions during the "full" mining process is increased and the process becomes user-driven. DiSC'03 © 2003 Association for Computing Machinery