Abstract
In this chapter, we present a two–phase iterative algorithm (proposed in [27]) that extends the functionality of the inline algorithm of [23] (Chapter 14) to allow for the identification of exact hiding solutions for a wider spectrum of problem instances. A problem instance is defined as the set of (i) the original dataset \(\mathcal{D_O}\), (ii) the minimum frequency threshold mfreq that is considered for its mining, and (iii) the set of sensitive itemsets S that have to be protected. Since the inline algorithm allows only supported items in \(\mathcal{D_O}\) to become unsupported in \(\mathcal{D}\), there exist problem instances that although they allow for an exact hiding solution, the inline approach is incapable of finding it. The truthfulness of this statement can be observed in the experiments provided in Section 15.4, as well as in the experimental evaluation of [26].
Keywords
- Problem Instance
- Frequent Itemset
- Feasible Constraint
- Minimum Support Threshold
- Downward Closure Property
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gkoulalas-Divanis, A., Verykios, V.S. (2010). Two-Phase Iterative Algorithm. In: Association Rule Hiding for Data Mining. Advances in Database Systems, vol 41. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6569-1_15
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6569-1_15
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6568-4
Online ISBN: 978-1-4419-6569-1
eBook Packages: Computer ScienceComputer Science (R0)