A Frequent Itemset Hiding Toolbox
Vasileios Kagklis, Elias C. Stavropoulos, Vassilios S. Verykios

TL;DR
This paper introduces a toolbox with multiple algorithms for hiding frequent itemsets in transactional data to protect sensitive patterns, demonstrating its efficiency through experiments on real datasets.
Contribution
It presents a comprehensive toolbox of frequent itemset hiding algorithms with a novel architecture and experimental validation on real-world data.
Findings
The toolbox efficiently hides frequent itemsets in real datasets.
It enables comparison of different hiding algorithms.
Experimental results show practical effectiveness and usability.
Abstract
Advances in data collection and data storage technologies have given way to the establishment of transactional databases among companies and organizations, as they allow enormous amounts of data to be stored efficiently. Useful knowledge can be mined from these data, which can be used in several ways depending on the nature of the data. Quite often companies and organizations are willing to share data for the sake of mutual benefit. However, the sharing of such data comes with risks, as problems with privacy may arise. Sensitive data, along with sensitive knowledge inferred from this data, must be protected from unintentional exposure to unauthorized parties. One form of the inferred knowledge is frequent patterns mined in the form of frequent itemsets from transactional databases. The problem of protecting such patterns is known as the frequent itemset hiding problem. In this paper…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Internet Traffic Analysis and Secure E-voting
