Iceberg query lattices for datalog

Gerd Stumme

pp. 109-125

in: Karl E. Wolff, Heather D. Pfeiffer, Harry Delugach (eds), Conceptual structures at work, Berlin, Springer, 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.