Closed sets based discovery of small covers for association rules (extended version)

Abstract : In this paper, we address the problem of the usefulness of the set of discovered association rules. This problem is important since real-life databases yield most of the time several thousands of rules with high confidence. We propose new algorithms based on Galois closed sets to reduce the extraction to small covers (or bases) for exact and approximate rules, adapted from lattice theory and data analysis domain. Once frequent closed itemsets – which constitute a generating set for both frequent itemsets and association rules – have been discovered, no additional database pass is needed to derive these bases. Experiments conducted on real-life databases show that these algorithms are efficient and valuable in practice.
Type de document :
Article dans une revue
Networking and Information Systems, 2001, 3 (2), pp.349-377
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00467759
Contributeur : Nicolas Pasquier <>
Soumis le : lundi 26 avril 2010 - 01:36:16
Dernière modification le : vendredi 3 février 2017 - 10:55:37
Document(s) archivé(s) le : mardi 14 septembre 2010 - 17:40:59

Fichier

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

Identifiants

  • HAL Id : hal-00467759, version 1

Citation

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal. Closed sets based discovery of small covers for association rules (extended version). Networking and Information Systems, 2001, 3 (2), pp.349-377. 〈hal-00467759〉

Partager

Métriques

Consultations de
la notice

185

Téléchargements du document

76