An audit environment for outsourcing of frequent itemset mining
Proceedings of the VLDB Endowment
A new classification of datasets for frequent itemsets
Journal of Intelligent Information Systems
Towards bounding sequential patterns
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Sciences: an International Journal
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |
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.