KOBRA - Dokumentenserver der Universität Kassel  → Fachbereiche  → FB 16 Elektrotechnik / Informatik  → Informatik   → Wissensverarbeitung  → Publikationen 

Please use this identifier to cite or link to this item: http://nbn-resolving.de/urn:nbn:de:hebis:34-2009022326389

Title: Mining minimal non-redundant association rules using frequent closed itemsets
Authors: Bastide, YvesPasquier, NicolasTaouil, RafikStumme, GerdLakhal, Lotfi
???metadata.dc.subject.swd???: Data MiningEffizienter Algorithmus
???metadata.dc.subject.ddc???: 004 - Informatik (Data processing Computer science)
Issue Date: 2000
Abstract: 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 consequences, 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.
URI: urn:nbn:de:hebis:34-2009022326389
???metadata.dc.description.everything???: Auch erschienen in: Lloyd, John u.a. (Hrsg.): Computationa logic. (Lecture notes in computer science ; 1861). Berlin u.a. : Springer, 2000. ISBN 3-540-67797-6. (The original publication is available at www.springerlink.com)
Appears in Collections:Publikationen

Files in This Item:

File Description SizeFormat
StummeMining_2000.pdf248.01 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.