Preserving Privacy in Association Rule Mining with Bloom Filters

• Main Authors: QIU, Ling, LI, Yingjiu, Wu, Xintao
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2007
• Subjects: Association rule mining - Bloom filters - Privacy preserving; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/856; http://dx.doi.org/10.1007/s10844-006-0018-8
• Institution: Singapore Management University

Privacy preserving association rule mining has been an active research area since recently. To this problem, there have been two different approaches—perturbation based and secure multiparty computation based. One drawback of the perturbation based approach is that it cannot always fully preserve individual’s privacy while achieving precision of mining results. The secure multiparty computation based approach works only for distributed environment and needs sophisticated protocols, which constrains its practical usage. In this paper, we propose a new approach for preserving privacy in association rule mining. The main idea is to use keyed Bloom filters to represent transactions as well as data items. The proposed approach can fully preserve privacy while maintaining the precision of mining results. The tradeoff between mining precision and storage requirement is investigated. We also propose δ-folding technique to further reduce the storage requirement without sacrificing mining precision and running time.