Issue No. 11 - November (2011 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.106
Rinku Dewri , University of Denver, Denver
Indrajit Ray , Colorado State University, Fort Collins
Indrakshi Ray , Colorado State University, Fort Collins
Darrell Whitley , Colorado State University, Fort Collins
Privacy constraints are typically enforced on shared data that contain sensitive personal attributes. However, owing to its adverse effect on the utility of the data, information loss must be minimized while sanitizing the data. Existing methods for this purpose modify the data only to the extent necessary to satisfy the privacy constraints, thereby asserting that the information loss has been minimized. However, given the subjective nature of information loss, it is often difficult to justify such an assertion. In this paper, we propose an interactive procedure to generate a data generalization scheme that optimally meets the preferences of the data publisher. A data publisher guides the sanitization process by specifying aspirations in terms of desired achievement levels in the objectives. A reference direction based methodology is used to investigate neighborhood solutions if the generated scheme is not acceptable. This approach draws its power from the constructive input received from the publisher about the suitability of a solution before finding a new one.
K-anonymity, reference point optimization.
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell Whitley, "k-Anonymization in the Presence of Publisher Preferences", IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 1678-1690, November 2011, doi:10.1109/TKDE.2011.106