Dhaigude, Ajinkya A and Kumar, Preetham (2014) Improved slicing algorithm for greater utility in privacy preserving data publishing. International Journal of Data Engineering, 5 (2). pp. 14-21. ISSN 2180-1274
![]() |
PDF
preetham.pdf - Published Version Restricted to Registered users only Download (375kB) | Request a copy |
Abstract
Several algorithms and techniques have been proposed in recent years for the publication of sensitive microdata. However, there is a trade-off to be considered between the level of privacy offered and the usefulness of the published data. Recently, slicing was proposed as a novel technique for increasing the utility of an anonymized published dataset by partitioning the dataset vertically and horizontally. This work proposes a novel technique to increase the utility of a sliced dataset even further by allowing overlapped clustering while maintaining the prevention of membership disclosure. It is further shown that using an alternative algorithm to Mondrian increases the efficiency of slicing. This paper shows though workload experiments that these improvements help preserve data utility better than traditional slicing
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Data Anonymization, Privacy Preservation, Data Mining, Slicing |
Subjects: | Engineering > MIT Manipal > Information and Communication Technology |
Depositing User: | MIT Library |
Date Deposited: | 28 Nov 2014 09:32 |
Last Modified: | 28 Nov 2014 09:32 |
URI: | http://eprints.manipal.edu/id/eprint/141157 |
Actions (login required)
![]() |
View Item |