Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Nicolas Pasquier <>
Submitted on : Monday, April 26, 2010 - 1:36:16 AM
Last modification on : Wednesday, April 21, 2021 - 8:52:05 AM
Long-term archiving on: : Tuesday, September 14, 2010 - 5:40:59 PM


Files produced by the author(s)


  • HAL Id : hal-00467759, version 1


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⟩



Record views


Files downloads