The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used to benchmark performance of algorithms, tend to have distributions far different from those observed in real datasets. In this paper we focus on the problem of synthetic database generation and propose algorithms to effectively embed within the database, any given set of maximal pattern collections, and make the following contributions: 1. A database generation technique is presented which takes k maximal itemset collections as input, and constructs a database which produces these maximal collections as output, when mined at k levels of support. To analyze the efficiency of the procedure, upper bounds are provided on the number of transactions output in the generated database. 2. A compression method is used and extended to reduce the size of the output database. An optimization to the generation procedure is provided which could potentially reduce the number of transactions generated. 3. Preliminary experimental results are presented to demonstrate the feasibility of using the generation technique.
|Number of pages||10|
|Journal||Proceedings of the International Database Engineering and Applications Symposium, IDEAS|
|Publication status||Published - 1 Jan 2005|
|Event||9th International Database Engineering and Application Symposium, IDEAS 2005 - Montreal, Canada|
Duration: 25 Jul 2005 → 27 Jul 2005
ASJC Scopus subject areas
- Computer Science(all)