Itemset Support Queries using Frequent Itemsets and Their Condensed Representations
Taneli Mielikäinen, Pance Panov and Saso Dzeroski
In: Discovery Science 2006, 7-10 Oct 2006, Barcelona, Spain.
The purpose of this paper is two-fold: First, we give efficient
algorithms for answering itemset support queries for collections of
itemsets from various representations of the frequency information.
As index structures we use itemset tries of transaction databases,
frequent itemsets and their condensed representations. Second, we
evaluate the usefulness of condensed representations of frequent
itemsets to answer itemset support queries using the proposed query
algorithms and index structures. We study analytically the worst-case
time complexities of querying the condensed representations and evaluate
experimentally the query efficiency with random itemset queries to
several benchmark transaction databases.