
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Gabriel Ghinita, Panos Kalnis, Yufei Tao, "Anonymous Publication of Sensitive Transactional Data," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 2, pp. 161174, February, 2011.  
BibTex  x  
@article{ 10.1109/TKDE.2010.101, author = {Gabriel Ghinita and Panos Kalnis and Yufei Tao}, title = {Anonymous Publication of Sensitive Transactional Data}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, number = {2}, issn = {10414347}, year = {2011}, pages = {161174}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.101}, 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  Anonymous Publication of Sensitive Transactional Data IS  2 SN  10414347 SP161 EP174 EPD  161174 A1  Gabriel Ghinita, A1  Panos Kalnis, A1  Yufei Tao, PY  2011 KW  Privacy KW  anonymity KW  transactional data. VL  23 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] G. Ghinita, Y. Tao, and P. Kalnis, "On the Anonymization of Sparse, HighDimensional Data," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 715724, 2008.
[2] A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, "lDiversity: Privacy beyond kAnonymity," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2006.
[3] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, "Incognito: Efficient FullDomain kAnonymity," Proc. ACM SIGMOD, pp. 4960, 2005.
[4] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, "Mondrian Multidimensional kAnonymity," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2006.
[5] C.C. Aggarwal, "On kAnonymity and the Curse of Dimensionality," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 901909, 2005.
[6] X. Xiao and Y. Tao, "Anatomy: Simple and Effective Privacy Preservation," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 139150, 2006.
[7] A. Gionis, P. Indyk, and R. Motwani, "Similarity Search in High Dimensions via Hashing," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 518529, 1999.
[8] S. Skiena, Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. AddisonWesley, 1990.
[9] B.C. Chen, K. LeFevre, and R. Ramakrishnan, "Privacy Skyline: Privacy with Multidimensional Adversarial Knowledge," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 770781, 2007.
[10] R. Agrawal and R. Srikant, "Privacy Preserving Data Mining," Proc. ACM SIGMOD, pp. 439450, 2000.
[11] Z. Huang, W. Du, and B. Chen, "Deriving Private Information from Randomized Data," Proc. ACM SIGMOD, pp. 3748, 2005.
[12] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, "WorkloadAware Anonymization," Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 277286, 2006.
[13] P. Samarati, "Protecting Respondents' Identities in Microdata Release," IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp. 10101027, Nov./Dec. 2001.
[14] G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu, "Achieving Anonymity via Clustering," Proc. ACM Symp. Principles of Database Systems (PODS), pp. 153162, 2006.
[15] G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis, "Fast Data Anonymization with Low Information Loss," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 758769, 2007.
[16] Q. Zhang, N. Koudas, D. Srivastava, and T. Yu, "Aggregate Query Answering on Anonymized Tables," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 116125, 2007.
[17] M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi, "Anonymity Preserving Pattern Discovery," VLDB J., vol. 17, pp. 703727, 2008.
[18] V. Verykios, A. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, "Association Rule Hiding," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 4, pp. 434447, Apr. 2004.
[19] C.C. Aggarwal and P.S. Yu, "On PrivacyPreservation of Text and Sparse Binary Data with Sketches," Proc. SIAM Conf. Data Mining, 2007.
[20] M. Terrovitis, N. Mamoulis, and P. Kalnis, "PrivacyPreserving Anonymization of SetValued Data," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2008.
[21] Y. Xu, K. Wang, A.W.C. Fu, and P.S. Yu, "Anonymizing Transaction Databases for Publication," Proc. SIGKDD, pp. 767775, 2008.
[22] D. Richards, "Data Compression and GrayCode Sorting," Information Processing Letters, vol. 22, pp. 201205, 1986.
[23] A. Pinar, T. Tao, and H. Ferhatosmanoglu, "Compressing Bitmap Indices by Data Reorganization," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 310321, 2005.
[24] D. Kifer and J. Gehrke, "Injecting Utility into Anonymized Datasets," Proc. ACM SIGMOD, pp. 217228, 2006.
[25] A. Andoni, M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, Nearest Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, 2006.
[26] J.K. Reid and J.A. Scott, "Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix," SIAM J. Matrix Analysis and Applications, vol. 28, no. 3, pp. 805821, 2006.
[27] C. Papadimitriou, "The NPCompleteness of the Bandwidth Minimization Problem," Computing, vol. 16, pp. 263270, 1976.
[28] Z. Zheng, R. Kohavi, and L. Mason, "Real World Performance of Association Rule Algorithms," Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 401406, 2001.
[29] A. Narayanan and V. Shmatikov, "How to Break Anonymity of the Netflix Prize Dataset," http://arxiv.org/abs/cs0610105, 2010.