The Community for Technology Leaders
Green Image
Issue No. 02 - February (2011 vol. 23)
ISSN: 1041-4347
pp: 161-174
Gabriel Ghinita , Purdue University, West Lafayette
Panos Kalnis , King Abdullah University of Science and Technology (KAUST), Jeddah
Yufei Tao , Chinese University of Hong Kong, Hong Kong
Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as k-anonymity and \ell-diversity, while minimizing the information loss incurred in the anonymizing process (i.e., maximize data utility). Existing techniques work well for fixed-schema data, with low dimensionality. Nevertheless, certain applications require privacy-preserving publishing of transactional data (or basket data), which involve hundreds or even thousands of dimensions, rendering existing methods unusable. We propose two categories of novel anonymization methods for sparse high-dimensional data. The first category is based on approximate nearest-neighbor (NN) search in high-dimensional spaces, which is efficiently performed through locality-sensitive hashing (LSH). In the second category, we propose two data transformations that capture the correlation in the underlying data: 1) reduction to a band matrix and 2) Gray encoding-based sorting. These representations facilitate the formation of anonymized groups with low information loss, through an efficient linear-time heuristic. We show experimentally, using real-life data sets, that all our methods clearly outperform existing state of the art. Among the proposed techniques, NN-search yields superior data utility compared to the band matrix transformation, but incurs higher computational overhead. The data transformation based on Gray code sorting performs best in terms of both data utility and execution time.
Privacy, anonymity, transactional data.

G. Ghinita, Y. Tao and P. Kalnis, "Anonymous Publication of Sensitive Transactional Data," in IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 161-174, 2010.
93 ms
(Ver 3.3 (11022016))