Characterizing Transactional Databases for Frequent Itemset Mining
Christian Lezcano, Marta Arias

TL;DR
This paper analyzes the characteristics of transactional databases used in frequent itemset mining, proposing new metrics to better understand dataset diversity and representativeness for benchmarking purposes.
Contribution
It introduces a comprehensive set of metrics, including new ones, to characterize transactional datasets and assesses their effectiveness in capturing dataset complexity.
Findings
Metrics effectively capture dataset complexity
Proposed datasets are representative for benchmarking
Enhanced understanding of dataset diversity
Abstract
This paper presents a study of the characteristics of transactional databases used in frequent itemset mining. Such characterizations have typically been used to benchmark and understand the data mining algorithms working on these databases. The aim of our study is to give a picture of how diverse and representative these benchmarking databases are, both in general but also in the context of particular empirical studies found in the literature. Our proposed list of metrics contains many of the existing metrics found in the literature, as well as new ones. Our study shows that our list of metrics is able to capture much of the datasets' inner complexity and thus provides a good basis for the characterization of transactional datasets. Finally, we provide a set of representative datasets based on our characterization that may be used as a benchmark safely.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Rough Sets and Fuzzy Logic · Data Management and Algorithms
