Distortion-based heuristic sensitive rule hiding method - The greedy way

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

Abstract

Today, people can use various database techniques to discover useful knowledge from large collections of data. However, people also face the risk of disclosing sensitive information to competitor when the data is shared between different organizations. Thus, there is a balance between the legitimate mining need and protection of confidential knowledge when people release or share data. In this paper, we study the privacy preserving in association rule mining. A new distortion-based method was proposed which hides sensitive rules by removing some items in database so as to reduce the support or confidence of sensitive rules below specified thresholds. Aimed at minimizing side effects, the number of sensitive rules and the number of non-sensitive rules supported by each transaction are utilized to sort the transactions and the candidates which contain most sensitive rules and least non-sensitive rules are selected to modify. Comparative experiments on real datasets showed that the new method can achieve satisfactory results with fewer side effects and data loss.

Cite

CITATION STYLE

APA

Cheng, P., Chu, S. C., Lin, C. W., & Roddick, J. F. (2014). Distortion-based heuristic sensitive rule hiding method - The greedy way. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 8481, pp. 77–86). Springer Verlag. https://doi.org/10.1007/978-3-319-07455-9_9

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