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-2009031726692

Title: Iceberg query lattices for datalog
Authors: Stumme, Gerd
???metadata.dc.subject.swd???: Data MiningFormale Begriffsanalyse
???metadata.dc.subject.ddc???: 004 - Informatik (Data processing Computer science)
Issue Date: 2004
Abstract: In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent itemsets by means of Formal Concept Analysis (FCA). We combine the notion of frequent datalog queries with iceberg concept lattices (also called closed itemsets) of FCA and introduce two kinds of iceberg query lattices as condensed representations of frequent datalog queries. We demonstrate that iceberg query lattices provide a natural way to visualize relational association rules in a non-redundant way.
URI: urn:nbn:de:hebis:34-2009031726692
???metadata.dc.description.everything???: Auch erschienen in: Wolff, Karl Erich u.a. (Hrsg.): Conceptual structures at work. (Lecture notes in computer science ; 3127). Berlin u.a. : Springer, 2004. S. 109-125. ISBN 3-540-22392-4 (The original publication is available at www.springerlink.com)
Appears in Collections:Publikationen

Files in This Item:

File Description SizeFormat
StummeIcebergQueryLattices2004.pdf149.65 kBAdobe PDFView/Open

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