Abstract
Sun & Yu [66, 67] in 2005 proposed the first frequent itemset hiding methodology that relies on the notion of the border [46] of the nonsensitive frequent itemsets to track the impact of altering transactions in the original database. By evaluating the impact of each candidate item modification to the itemsets of the revised positive border, the algorithm greedily selects to apply those modifications (item deletions) that cause the least impact to the border itemsets. As already covered in the previous chapter, the border itemsets implicitly dictate the status (i.e., frequent vs. infrequent) of every itemset in the database. Consequently, the quality of the borders directly affects the quality of the sanitized database that is produced by the hiding algorithm.
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). BBA 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_10
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6569-1_10
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)