Subscribe

Issue No.11 - November (2009 vol.21)

pp: 1643-1647

Michael Laszlo , Nova Southeastern University, Fort Lauderdale

Sumitra Mukherjee , Nova Southeastern University, Fort Lauderdale

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.78

ABSTRACT

The NP-hard microaggregation problem seeks a partition of data points into groups of minimum specified size k, so as to minimize the sum of the squared euclidean distances of every point to its group's centroid. One recent heuristic provides an {\rm O}(k^3) guarantee for this objective function and an {\rm O}(k^2) guarantee for a version of the problem that seeks to minimize the sum of the distances of the points to its group's centroid. This paper establishes approximation bounds for another microaggregation heuristic, providing better approximation guarantees of {\rm O}(k^2) for the squared distance measure and {\rm O}(k) for the distance measure.

INDEX TERMS

Data security, disclosure control, microdata protection, microaggregation, k-anonymity, approximation algorithms, graph partitioning, information loss.

CITATION

Michael Laszlo, Sumitra Mukherjee, "Approximation Bounds for Minimum Information Loss Microaggregation",

*IEEE Transactions on Knowledge & Data Engineering*, vol.21, no. 11, pp. 1643-1647, November 2009, doi:10.1109/TKDE.2009.78REFERENCES

- [2] G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu, “Approximation Algorithms for k-Anonymity,”
J.Privacy Technology, Nov. 2005, http://www.jopt.org/publications20051120001_aggarwal.pdf . - [3] R. Bar-Yehuda, K. Bendel, A. Freund, and D. Rawitz, “Local Ratio: A Unified Framework for Approximation Algorithms. In Memoriam: Shimon Even 1935-2004,”
ACM Computing Surveys (CSUR), vol. 36, no. 4, pp. 422-463, 2004.- [8] S. Durocher and D. Kirkpatrick, “The Projection Median of a Set of Points in $R^2$ ,”
Proc. 17th Canadian Conf. Computational Geometry (CCCG '05), pp. 47-51, 2005.- [10] M.X. Goemans and D.P. Williamson, “The Primal-Dual Method for Approximation Algorithms and Its Application to Network Design Problems,”
Approximation Algorithms, D. Hochbaum, ed., pp. 144-191, 1997.- [18] A. Oganian and J. Domingo-Ferrer, “On the Complexity of Optimal Microaggregation for Statistical Disclosure Control,”
Statistical J. United Nations Economic Commission for Europe, vol. 18, no. 4, pp. 345-354, 2001.- [20] L. Sweeney, “K-Anonymity: A Model for Protecting Privacy,”
Int'l J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.- [21] A. Willenborg and T. De Waal,
Elements of Statistical Disclosure Control. Springer-Verlag, 2000. |