A New Scheme on Privacy Preserving Association Rule Mining

This work addresses the privacy preserving association rule mining problem in a system with one data miner and multiple data providers, each holds one transaction with an algebraic techniques based scheme that can identify association rules more accurately but disclose less private information.

Abstract

We address the privacy preserving association rule mining problem in a system with one data miner and multiple data providers, each holds one transaction. The literature has tacitly assumed that randomization is the only effective approach to preserve privacy in such circumstances. We challenge this assumption by introducing an algebraic techniques based scheme. Compared to previous approaches, our new scheme can identify association rules more accurately but disclose less private information. Furthermore, our new scheme can be readily integrated as a middleware with existing systems.