PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

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.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
Information Retrieval & Textual Information Access
ID Code:2162
Deposited By:Taneli Mielikäinen
Deposited On:11 August 2006