Optimizing inductive queries in frequent itemsets mining

Abstract

Let Q = {Q1, . . . , Qn} be a set of past queries and let R = {R1, . . . , Rn} be their results. Moreover, let Q0 be a query newly submitted to the system and let R0 be its result. The task of optimizing the extraction of R0 using the knowledge provided by Q and R have been faced following two distinct approaches. In the first approach we search for a query… (More)

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Botta2004OptimizingIQ, title={Optimizing inductive queries in frequent itemsets mining}, author={Marco Botta and Roberto Esposito and Arianna Gallo}, year={2004} }