A new scheme on privacy preserving association rule mining

15Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Zhang, N., Wang, S., & Zhao, W. (2004). A new scheme on privacy preserving association rule mining. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3202, 484–495. https://doi.org/10.1007/978-3-540-30116-5_44

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