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.
Type de document :
Article dans une revue
Journal of Intelligent Information Systems, Springer Verlag, 2005, 24 (1), pp.29-60. <10.1007/s10844-005-0266-z>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00363015
Contributeur : Nicolas Pasquier <>
Soumis le : lundi 26 avril 2010 - 12:35:58
Dernière modification le : mercredi 11 mai 2016 - 13:20:48
Document(s) archivé(s) le : mardi 14 septembre 2010 - 17:01:25

Fichier

Generating_a_condensed_represe...
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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>

Partager

Métriques

Consultations de
la notice

291

Téléchargements du document

146