Solving the sensitive itemset hiding problem whilst minimizing side effects on a sanitized database

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mining frequent itemsets from huge amounts of data is an important issue in data mining, with the retrieved information often being commercially valuable. However, some sensitive itemsets have to be hidden in the database due to privacy or security concerns. This study aimed to secure sensitive information contained in patterns extracted during association-rule mining. The proposed approach successfully hides sensitive itemsets whilst minimizing the impact of the sanitization process on nonsensitive itemsets. Our approach ensures that any modification to the database is controlled according to its impact on the sanitized database. The results of simulations demonstrate the benefits of our approach. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Lee, G., Chen, Y. C., Peng, S. L., & Lin, J. H. (2011). Solving the sensitive itemset hiding problem whilst minimizing side effects on a sanitized database. In Communications in Computer and Information Science (Vol. 223 CCIS, pp. 104–113). https://doi.org/10.1007/978-3-642-23948-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free