DocumentCode
3288025
Title
Aggregation and privacy in multi-relational databases
Author
Jafer, Yasser ; Viktor, Herna L. ; Paquet, Eric
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Univ. of Ottawa, Ottawa, ON, Canada
fYear
2012
fDate
16-18 July 2012
Firstpage
67
Lastpage
74
Abstract
The aim of privacy-preserving data mining is to construct highly accurate predictive models while not disclosing privacy information. Aggregation functions, such as sum and count are often used to pre-process the data prior to applying data mining techniques to relational databases. Often, it is implicitly assumed that the aggregated (or summarized) data are less likely to lead to privacy violations during data mining. This paper investigates this claim, within the relational database domain. We introduce the PBIRD (Privacy Breach Investigation in Relational Databases) methodology. Our experimental results show that aggregation potentially introduces new privacy violations. That is, potentially harmful attributes obtained with aggregation are often different from the ones obtained from non-aggregated databases. This indicates that, even when privacy is enforced on non-aggregated data, it is not automatically enforced on the corresponding aggregated data. Consequently, special care should be taken during model building in order to fully enforce privacy when the data are aggregated.
Keywords
data mining; data privacy; relational databases; PBIRD; multirelational databases; privacy breach investigation; privacy information; privacy-preserving data mining; Classification algorithms; Data privacy; Privacy; Relational databases; Thrombosis;
fLanguage
English
Publisher
ieee
Conference_Titel
Privacy, Security and Trust (PST), 2012 Tenth Annual International Conference on
Conference_Location
Paris
Print_ISBN
978-1-4673-2323-9
Electronic_ISBN
978-1-4673-2325-3
Type
conf
DOI
10.1109/PST.2012.6297921
Filename
6297921
Link To Document