Skip to Main Content
ASME Press Select Proceedings

International Conference on Software Technology and Engineering (ICSTE 2012)

Editor
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791860151
No. of Pages:
680
Publisher:
ASME Press
Publication date:
2012

This paper proposes a novel approach for hiding a set of sensitive association rules based on intersection lattice theory and distance concepts. It aims to examine the optimal distance from the top of the intersection lattice of frequent itemsets to the sensitive association rules (SR), as well as to the nonsensitive association rules, in order to hide SR in such a way that the data modifications cause the least side effects. The experiment indicates that the proposed algorithm achieves better results in minimizing side effects and complexity compared with the previous works.

1. Introduction
2. Related Works
3. Problem Formulation
4. The Proposed Approach
5. Performance and Simulation Results
6. Conclusions and Future Works
Reference
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal