Using unknowns to prevent discovery of association rules
ACM SIGMOD Record
Hiding Association Rules by Using Confidence and Support
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
An integer programming approach for frequent itemset hiding
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, efficiency is not our only concern in this study. The security and privacy issues over the extracted knowledge must be seriously considered as well. By taking this into consideration, we study the procedure of hiding sensitive association rules in binary data sets by blocking some data values and we present an algorithm for solving this problem. We also provide a fuzzification of the support and the confidence of an association rule in order to accommodate for the existence of blocked/unknown values. In addition, we quantitatively compare the proposed algorithm with other already published algorithms by running experiments on binary data sets, and we also qualitatively compare the efficiency of the proposed algorithm in hiding association rules. We utilize the notion of border rules, by putting weights in each rule, and we use effective data structures for the representation of the rules so as (a) to minimize the side effects created by the hiding process and (b) to speed up the selection of the victim transactions. Finally, we discuss the advantages and the limitations of blocking.