Condensed Representations for Sets of Mining Queries

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.

[1]  David J. DeWitt,et al.  Using a knowledge cache for interactive discovery of association rules , 1999, KDD '99.

[2]  Gerd Stumme,et al.  Mining frequent patterns with counting inference , 2000, SKDD.

[3]  Lotfi Lakhal,et al.  Computing Full and Iceberg Datacubes Using Partitions , 2002, ISMIS.

[4]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[5]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[6]  Tadeusz Morzy,et al.  Materialized Data Mining Views , 2000, PKDD.

[7]  Jean-François Boulicaut,et al.  Using Condensed Representations for Interactive Association Rule Mining , 2002, PKDD.

[8]  Heikki Mannila,et al.  Verkamo: Fast Discovery of Association Rules , 1996, KDD 1996.

[9]  Heikki Mannila,et al.  Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.

[10]  Nicolas Spyratos,et al.  Composition of Mining Contexts for Efficient Extraction of Association Rules , 2002, EDBT.

[11]  Jean-François Boulicaut,et al.  Approximation of Frequency Queris by Means of Free-Sets , 2000, PKDD.

[12]  Luc De Raedt,et al.  The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding , 2001, IJCAI.

[13]  Elena Baralis,et al.  Incremental Refinement of Mining Queries , 1999, DaWaK.

[14]  Haym Hirsh,et al.  Generalizing Version Spaces , 1994, Machine Learning.