Condensed representations for sets of mining queries

Abstract

In this paper, we propose a general framework for condensed representations of sets of mining queries. To this end, we adapt the standard notions of maximal, closed and key patterns introduced in previous works, including those dealing with condensed representations. Whereas these previous works concentrate on condensed representations of the answer to a single mining query, we consider the more general case of sets of mining queries defined by monotonic and anti-monotonic selection predicates. © Springer-Verlag Berlin Heidelberg 2004.