Privacy preserving frequent itemset mining
- Stanley R. Oliveira
- Osmar R. Zaiane, University of Alberta (Database)
One crucial aspect of privacy preserving frequent itemset mining is the fact that the mining process deals with a trade-off: privacy and accuracy, which are typically contradictory, and improving one usually incurs a cost in the other. One alternative to address this particular problem is to look for a balance between hiding restrictive patterns and disclosing nonrestrictive ones. In this paper, we propose a new framework for enforcing privacy in mining frequent itemsets. We combine, in a single framework, techniques for efficiently hiding restrictive patterns: a transaction retrieval engine relying on an inverted file and Boolean queries; and a set of algorithms to “sanitize” a database. In addition, we introduce performance measures for mining frequent itemsets that quantify the fraction of mining patterns which are preserved after sanitizing a database. We also report the results of a performance evaluation of our research prototype and an analysis of the results.
Citation
S. Oliveira, O. Zaiane. "Privacy preserving frequent itemset mining". Workshop on Privacy, Security, and Data Mining, pp 43-54, December 2002.| Keywords: | Association Rule Mining, Privacy Preserving Data Mining, Privacy Preservation in Association Rule Mining, Frequent Itemset Mining, Security |
| Category: | In Workshop |
BibTeX
@misc{Oliveira+Zaiane:02,
author = {Stanley R. Oliveira and Osmar R. Zaiane},
title = {Privacy preserving frequent itemset mining},
Pages = {43-54},
booktitle = {Workshop on Privacy, Security, and Data Mining},
year = 2002,
}Last Updated: February 04, 2020Submitted by Sabina P
