Generating a condensed representation for association rules

Abstract : Association rule extraction from operational datasets often produces several tens of thousands, and even millions, of association rules. Moreover, many of these rules are redundant and thus useless. Using a semantic based on the closure of the Galois connection, we define a condensed representation for association rules. This representation is characterized by frequent closed itemsets and their generators. It contains the non-redundant association rules having minimal antecedent and maximal consequent, called min-max association rules. We think that these rules are the most relevant since they are the most general non-redundant association rules. Furthermore, this representation is a basis, i.e., a generating set for all association rules, their supports and their confidences, and all of them can be retrieved needless accessing the data. We introduce algorithms for extracting this basis and for reconstructing all association rules. Results of experiments carried out on real datasets show the usefulness of this approach. In order to generate this basis when an algorithm for extracting frequent itemsets—such as Apriori for instance—is used, we also present an algorithm for deriving frequent closed itemsets and their generators from frequent itemsets without using the dataset.
Liste complète des métadonnées
Contributor : Nicolas Pasquier <>
Submitted on : Monday, April 26, 2010 - 12:35:58 PM
Last modification on : Tuesday, October 9, 2018 - 11:46:06 AM
Document(s) archivé(s) le : Tuesday, September 14, 2010 - 5:01:25 PM


Files produced by the author(s)



Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, Lotfi Lakhal. Generating a condensed representation for association rules. Journal of Intelligent Information Systems, Springer Verlag, 2005, 24 (1), pp.29-60. ⟨10.1007/s10844-005-0266-z⟩. ⟨hal-00363015⟩



Record views


Files downloads