Inproceedings526

Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets

Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal

Published: 2000
Herausgeber: J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L., M. Pereira, Y. Sagiv, P., J. Stuckey
Buchtitel: Computational Logic - CL 2000. Proc. CL '00
Seiten: 972-986
Verlag: Springer, Heidelberg

Referierte Veröffentlichung

BibTeX

Kurzfassung
The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies. Using the closure of the Galois connection, we define two new bases for association rules which union is a generating set for all valid association rules with support and confidence. These bases are characterized using frequent closed itemsets and their generators; they consist of the non-redundant exact and approximate association rules having minimal antecedents and maximal consequents, i.e. the most relevant association rules. Algorithms for extracting these bases are presented and results of experiments carried out on real-life databases show that the proposed bases are useful, and that their generation is not time consuming.

Download: Media:2000_526_Bastide_Mining_Minimal__1.ps

Forschungsgruppe

Wissensmanagement

Forschungsgebiet