
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael Laszlo, Sumitra Mukherjee, "Approximation Bounds for Minimum Information Loss Microaggregation," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 11, pp. 16431647, November, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2009.78, author = {Michael Laszlo and Sumitra Mukherjee}, title = {Approximation Bounds for Minimum Information Loss Microaggregation}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {11}, issn = {10414347}, year = {2009}, pages = {16431647}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.78}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Approximation Bounds for Minimum Information Loss Microaggregation IS  11 SN  10414347 SP1643 EP1647 EPD  16431647 A1  Michael Laszlo, A1  Sumitra Mukherjee, PY  2009 KW  Data security KW  disclosure control KW  microdata protection KW  microaggregation KW  kanonymity KW  approximation algorithms KW  graph partitioning KW  information loss. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] N.R. Adam and J.C. Wortmann, “Security Control Methods for Statistical Databases: A Comparative Study,” ACM Computing Surveys, vol. 21, no. 4, pp. 515556, 1989.
[2] G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu, “Approximation Algorithms for kAnonymity,” J.Privacy Technology, Nov. 2005, http://www.jopt.org/publications20051120001_aggarwal.pdf .
[3] R. BarYehuda, K. Bendel, A. Freund, and D. Rawitz, “Local Ratio: A Unified Framework for Approximation Algorithms. In Memoriam: Shimon Even 19352004,” ACM Computing Surveys (CSUR), vol. 36, no. 4, pp. 422463, 2004.
[4] J. DomingoFerrer, F. Sebé, and A. Solanas, “A PolynomialTime Approximation to Optimal Multivariate Microaggregation,” Computers and Math. with Applications, vol. 55, no. 4, pp. 714732, 2008.
[5] J. DomingoFerrer and J.M. MateoSanz, “Practical DataOriented Microaggregation for Statistical Disclosure Control,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 1, pp. 189201, Jan./Feb. 2002.
[6] J. DomingoFerrer and V. Torra, “Ordinal, Continuous and Heterogeneous kAnonymity through Microaggregation,” Data Mining and Knowledge Discovery, vol. 11, no. 2, pp. 195212, 2005.
[7] J. DomingoFerrer, A. MartínezBallesté, J. MateoSanz, and F. Sebé, “Efficient Multivariate DataOriented Microaggregation,” The VLDB J., vol. 15, no. 4, pp. 355369, 2006.
[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. 4751, 2005.
[9] M.X. Goemans and D.P. Williamson, “Approximating MinimumCost Graph Problems with Spanning Tree Edges,” Operations Research Letters, vol. 16, pp. 183244, 1994.
[10] M.X. Goemans and D.P. Williamson, “The PrimalDual Method for Approximation Algorithms and Its Application to Network Design Problems,” Approximation Algorithms, D. Hochbaum, ed., pp. 144191, 1997.
[11] M.X. Goemans and D.P. Williamson, “A General Approximation Technique for Constrained Forest Problems,” SIAM J. Computing, vol. 24, pp. 296317, 1995.
[12] S.L. Hansen and S. Mukherjee, “A Polynomial Algorithm for Optimal Univariate Microaggregation,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 10431044, July/Aug. 2003.
[13] X.B. Li and S. Sarkar, “A TreeBased Data Perturbation Approach for PrivacyPreserving Data Mining,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 9, pp. 12781283, Sept. 2006.
[14] C. Imielińska, B. Kalantari, and L. Khachiyan, “A Greedy Heuristic for a MinimumWeight Forest Problem,” Operations Research Letters, vol. 14, pp.6571, 1993.
[15] M. Laszlo and S. Mukherjee, “Minimum Spanning Tree Partitioning Algorithm for Microaggregation,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 7, pp. 902911, July 2005.
[16] M. Laszlo and S. Mukherjee, “A Class of Heuristics for the Constrained Forest Problem,” Discrete Applied Math., vol. 154, no. 1, pp. 614, 2006.
[17] M. Laszlo and S. Mukherjee, “Another Greedy Heuristic for the Constrained Forest Problem,” Operations Research Letters, vol. 33, no. 6, pp. 629633, 2005.
[18] A. Oganian and J. DomingoFerrer, “On the Complexity of Optimal Microaggregation for Statistical Disclosure Control,” Statistical J. United Nations Economic Commission for Europe, vol. 18, no. 4, pp. 345354, 2001.
[19] P. Samarati, “Protecting Respondents' Identities in Microdata Release,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp. 10101027, Nov./Dec. 2001.
[20] L. Sweeney, “KAnonymity: A Model for Protecting Privacy,” Int'l J. Uncertainty, Fuzziness and KnowledgeBased Systems, vol. 10, no. 5, pp. 557570, 2002.
[21] A. Willenborg and T. De Waal, Elements of Statistical Disclosure Control. SpringerVerlag, 2000.