A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining

  • Authors:
  • Tianding Chen

  • Affiliations:
  • Zhejiang Gongshang University, China

  • Venue:
  • ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the researches of data mining, discovering frequent patterns from huge amounts of data is one of the most studied problems. The frequent patterns mined form databases can bring the users many commercial benefits. However, some sensitive patterns with security concerned may cause a threat to privacy. It investigates to find an appropriate balance between a need for privacy and information discovery on frequent patterns. It proposes a novel method for modifying databases to hide sensitive patterns. By multiplying the original database and a sanitization matrix together, a sanitized database with privacy concerns is obtained. Additionally, two probability policies are introduced to against the recovery of sensitive patterns and reduce the probability of hiding non-sensitive patterns in the sanitized database. The complexity analysis of our sanitization process is proved and a set of experiments is also performed to show the benefit of our approach.