Association rule hiding for privacy preserving data mining

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

Abstract

Privacy preservation is a big challenge in data mining. The protection of sensitive information becomes a critical issue when releasing data to outside parties. Association rule mining could be very useful in such situations. It could be used to identify all the possible ways by which ‘non-confidential’ data can reveal ‘confidential’ data, which is commonly known as ‘inference problem’. This issue is solved using Association Rule Hiding (ARH) techniques in Privacy Preserving Data Mining (PPDM). Association rule hiding aims to conceal these association rules so that no sensitive information can be mined from the database. This paper proposes a model for hiding sensitive association rules. The model is implemented with a Fast Hiding Sensitive Association Rule (FHSAR) algorithm using the java eclipse framework. The implemented algorithm is integrated with a Weka open source data mining tool. Model analysis and evaluation shows its efficiency by balancing the trade-off between utility and privacy preservation in data mining with minimal side effects.

Cite

CITATION STYLE

APA

Mogtaba, S., & Kambal, E. (2016). Association rule hiding for privacy preserving data mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9728, pp. 320–333). Springer Verlag. https://doi.org/10.1007/978-3-319-41561-1_24

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