Closed sets based discovery of small covers for association rules (extended version) - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networking and Information Systems Année : 2001

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

Résumé

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.
Fichier principal
Vignette du fichier
Closed_Set_Based_Discovery_of_Small_Covers_for_Association_Rules_Pasquier_et_al._NIS_2001.pdf (212.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00467759 , version 1 (26-04-2010)

Identifiants

  • HAL Id : hal-00467759 , version 1

Citer

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⟩
169 Consultations
118 Téléchargements

Partager

Gmail Facebook X LinkedIn More