The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2011 vol.23)
pp: 1678-1690
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
ABSTRACT
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.
INDEX TERMS
K-anonymity, reference point optimization.
CITATION
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. 11, pp. 1678-1690, November 2011, doi:10.1109/TKDE.2011.106
REFERENCES
[1] P. Golle , "Revisiting the Uniqueness of Simple Demographics in the US Population," Proc. Fifth ACM Workshop Privacy in Electronic Soc., pp. 77-80, 2006.
[2] P. Samarati and L. Sweeney , "Generalizing Data to Provide Anonymity when Disclosing Information," Proc. 17th ACM Symp. Principles of Database Systems, p. 188, 1998.
[3] L. Sweeney , "Achieving k-Anonymity Privacy Protection Using Generalization and Suppression," Int'l J. Uncertainity, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 571-588, 2002.
[4] R.J. Bayardo and R. Agrawal , "Data Privacy through Optimal k-Anonymization," Proc. 21st Int'l Conf. Data Eng., pp. 217-228, 2005.
[5] B.C.M. Fung , K. Wang , and P.S. Yu , "Top-Down Specialization for Information and Privacy Preservation," Proc. 21st Int'l Conf. Data Eng., pp. 205-216, 2005.
[6] A. Hundepool and L. Willenborg , "Mu and Tau Argus: Software for Statistical Disclosure Control," Proc. Third Int'l Seminar on Statistical Confidentiality, 1996.
[7] V.S. Iyengar , "Transforming Data to Satisfy Privacy Constraints," Proc. Eighth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 279-288, 2002.
[8] K. LeFevre , D.J. DeWitt , and R. Ramakrishnan , "Incognito: Efficient Full-Domain k-Anonymity," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 49-60, 2005.
[9] K. LeFevre , D.J. DeWitt , and R. Ramakrishnan , "Mondrian Multidimensional K-Anonymity," Proc. 22nd Int'l Conf. Data Eng., p. 25, 2006.
[10] G. Loukides and J. Shao , "Capturing Data Usefulness and Privacy Protection in k-Anonymisation," Proc. ACM Symp. Applied Computing, pp. 370-374, 2007.
[11] P. Samarati , "Protecting Respondents' Identities in Microdata Release," IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp. 1010-1027, Nov./Dec. 2001.
[12] K. Wang , P. Yu , and S. Chakraborty , "Bottom-Up Generalization: A Data Mining Solution to Privacy Protection," Proc. Fourth IEEE Int'l Conf. Data Mining, pp. 249-256, 2004.
[13] R. Dewri , I. Ray , I. Ray , and D. Whitley , "On the Comparison of Microdata Disclosure Control Algorithms," Proc. 12th Int'l Conf. Extending Database Technology, pp. 240-251, 2009.
[14] A. Meyerson and R. Williams , "On the Complexity of Optimal k-Anonymity," Proc. 23rd ACM Symp. Principles of Database Systems, pp. 223-228, 2004.
[15] A. Machanavajjhala , J. Gehrke , D. Kifer , and M. Venkitasubramaniam , " $\ell$ -Diversity: Privacy Beyond $k$ -Anonymity," Proc. 22nd Int'l Conf. Data Eng., p. 24, 2006.
[16] N. Li , T. Li , and S. Venkatasubramanian , " $t$ -Closeness: Privacy Beyond $k$ -Anonymity and $\ell$ -Diversity," Proc. 23rd Int'l Conf. Data Eng., pp. 106-115, 2007.
[17] X. Xiao and Y. Tao , "Personalized Privacy Preservation," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 229-240, 2006.
[18] J. Li , R.C. Wong , A.W. Fu , and J. Pei , "Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures," Proc. Proceesing of Eighth Int'l Conf. Data Warehousing and Knowledge Discovery, pp. 405-416, 2006.
[19] Q. Zhang , N. Koudas , D. Srivastava , and T. Yu , "Aggregate Query Answering on Anonymized Tables," Proc. 23rd Int'l Conf. Data Eng., pp. 116-125, 2007.
[20] R. Dewri , I. Ray , I. Ray , and D. Whitley , "On the Optimal Selection of k in the k-Anonymity Problem," Proc. 24th Int'l Conf. Data Eng., pp. 1364-1366, 2008.
[21] Z. Huang and W. Du , "OptRR: Optimizing Randomized Response Schemes for Privacy-Preserving Data Mining," Proc. 24th Int'l Conf. Data Eng., pp. 705-714, 2008.
[22] T. Li and N. Li , "On the Tradeoff between Privacy and Utility in Data Publishing," Proc. 15th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, pp. 517-526, 2009.
[23] S. Vassilvitskii and M. Yannakakis , "Efficiently Computing Succinct Trade-Off Curves," Theoretical Computer Science, vol. 348, no. 2, pp. 334-356, 2005.
[24] I. Diakonikolas and M. Yannakakis , "Small Approximate Pareto Sets for Bi-Objective Shortest Paths and Other Problems," Proc. Int'l Workshop Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 74-88, 2007.
[25] H. Ackermann , A. Newman , H. Röglin , and B. Vöcking , "Decision-Making Based on Approximate and Smoothed Pareto Curve," Theoretical Computer Science, vol. 378, no. 3, pp. 253-270, 2007.
[26] A.P. Wierzbicki , "The Use of Reference Objectives in Multiobjective Optimization," Proc. Multiple Criteria Decision Making Theory and Applications, pp. 468-486, 1980.
[27] Y. Yun , H. Nakayama , and M. Yoon , "Sequential Approximation Method in Multi-Objective Optimization Using Aspiration Level Approach," Evolutionary Multi-Criterion Optimization, vol. 4403, pp. 317-329, 2007.
[28] M. Luque , K. Miettinen , P. Eskelinen , and F. Ruiz , "Incorporating Preference Information in Interactive Reference Point Methods for Multiobjective Optimization," Omega, vol. 37, no. 2, pp. 450-462, 2009.
[29] K. Miettinen and M.M. Mäkelä , "On Scalarizing Functions in Multiobjective Optimization," OR Spectrum, vol. 24, no. 2, pp. 193-213, 2002.
[30] E. Miglierina and E. Molho , "Scalarization and Stability in Vector Optimization," J. Optimization Theory and Applications, vol. 114, no. 3, pp. 657-670, 2002.
[31] S. Börzsönyi , D. Kossmann , and K. Stocker , "The Skyline Operator," Proc. 17th Int'l Conf. Data Eng., pp. 421-430, 2001.
[32] R.C. Wong , A.W. Fu , K. Wang , and J. Pei , "Minimality Attack in Privacy Preserving Data Publishing," Proc. 33rd Int'l Conf. Very Large Data Bases, pp. 543-554, 2007.
[33] K. Miettinen and L. Kirilov , "Interactive Reference Direction Approach Using Implicit Parametrization for Nonlinear Multiobjective Optimization," J. Multi-Criteria Decision Analysis, vol. 13, nos. 2/3, pp. 115-123, 2005.
[34] K. Deb and A. Kumar , "Interactive Evolutionary Multi-Objective Optimization and Decision-Making Using Reference Direction Method," Proc. Genetic and Evolutionary Computation Conf., pp. 781-788, 2007.
[35] C.A.C. Coello , "An Updated Survey of GA-Based Multiobjective Optimization Techniques," ACM Computing Surveys, vol. 32, no. 2, pp. 109-143, 2000.
[36] K. Deb , A. Pratap , S. Agarwal , and T. Meyarivan , "A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II," IEEE Trans. Evolutionary Computation, vol. 6, no. 2, pp. 182-197, Apr. 2002.
[37] R. Dewri , I. Ray , I. Ray , and D. Whitley , "A Multi-Objective Approach to Data Sharing with Privacy Constraints and Preference Based Objectives," Proc. 11th Ann. Conf. Genetic and Evolutionary Computation, pp. 1499-1506, 2009.
[38] E. Alba and M. Tomassini , "Parallelism and Evolutionary Algorithms," IEEE Trans. Evolutionary Computation, vol. 6, no. 5, pp. 443-462, Oct. 2002.
[39] N. Melab , S. Cahon , and E.G. Talbi , "Grid Computing for Parallel Bioinspired Algorithms," J. Parallel and Distributed Computing, vol. 66, no. 8, pp. 1052-1061, 2006.
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool