Advertisement

Blocking Schemes

  • Aris Gkoulalas-Divanis
  • Vassilios S. Verykios
Chapter
Part of the Advances in Database Systems book series (ADBS, volume 41)

Abstract

An interesting line of research in the class of heuristic methodologies for association rule hiding regards approaches that block certain original values of a database by introducing unknowns (i.e., by replacing the real values of some items in selected transactions of the original database with question marks “?”). Unlike data distortion schemes, blocking methodologies do not add any false information to the original database and thus provide a much safer alternative for critical real life applications, where the distinction between “false” and “unknown” can be vital. Due to the introduction of unknowns, the support and the confidence of association rules that are mined from the sanitized database becomes fuzzified to an interval (rather than being an exact value) and can no longer be safely estimated. Blocking approaches, similarly to distortion approaches, can be partitioned into support-based and confidence-based, depending on whether they use the support or the confidence of the association rules to drive the hiding process. In this chapter, we review two methodologies that belong to this class of approaches.

Keywords

Association Rule Safety Margin Question Mark Data Utility Original Database 
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.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Aris Gkoulalas-Divanis
    • 1
  • Vassilios S. Verykios
    • 2
  1. 1.Information Analytics LabIBM Research GmbH - ZurichRueschlikonSwitzerland
  2. 2.Department of Computer and Communication EngineeringUniversity of ThessalyVolosGreece

Personalised recommendations