Abstract
In this chapter we provide the background and terminology that are necessary for the understanding of association rule hiding. Specifically, in Section 2.1, we present the theory behind association rule mining and introduce the notion of the positive and the negative borders of the frequent itemsets. Following that, Section 2.2 explicitly states the goals of association rule hiding methodologies, discusses the different types of solutions that association rule hiding algorithms can produce, as well as it delivers the formal problem statement for association rule hiding and its popular variant, frequent itemset hiding.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Background. 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_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6569-1_2
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)