{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:30:38Z","timestamp":1742358638115,"version":"3.40.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s11390-012-1203-6","type":"journal-article","created":{"date-parts":[[2012,1,9]],"date-time":"2012-01-09T18:16:58Z","timestamp":1326133018000},"page":"24-36","source":"Crossref","is-referenced-by-count":13,"title":["Publishing Set-Valued Data Against Realistic Adversaries"],"prefix":"10.1007","volume":"27","author":[{"given":"Jun-Qiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,9]]},"reference":[{"key":"1203_CR1","doi-asserted-by":"crossref","unstructured":"Liu J, Pan Y, Wang K, Han J. Mining frequent item sets by opportunistic projection. In Proc. the 8th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, Edmonton, Canada, July 2002, pp.229\u2013238.","DOI":"10.1145\/775047.775081"},{"key":"1203_CR2","unstructured":"Narayanan A, Shmatikov V. How to break anonymity of the Netflix prize dataset. ArXiv Computer Science e-prints, Volume: abs\/cs\/061, December 2005, pp.1\u201310."},{"key":"1203_CR3","unstructured":"Adar E. User 4XXXXX9: Anonymizing query logs. In Query Log Analysis Workshop at the 16th Int. World Wide Web Conf., Banff, Canada, May 2007."},{"key":"1203_CR4","unstructured":"Xiong L, Agichtein E. Towards privacy-preserving query log publishing. In Query Log Analysis Workshop at Int. World Wide Web Conf., Banff, Canada, May 2007."},{"key":"1203_CR5","doi-asserted-by":"crossref","unstructured":"He Y, Naughton J. Anonymization of set-valued data via top-down, local generalization. In Proc. Very Large Data Bases Conf., Lyon, France, August 2009, pp.934\u2013945.","DOI":"10.14778\/1687627.1687733"},{"key":"1203_CR6","doi-asserted-by":"crossref","unstructured":"Ghinita G, Tao Y, Kalnis P. On the anonymization of sparse high-dimensional data. In Proc. Int. Conf. Data Engineering, Cancun, Mexico, April 2008, pp.715\u2013724.","DOI":"10.1109\/ICDE.2008.4497480"},{"key":"1203_CR7","doi-asserted-by":"crossref","unstructured":"Terrovitis M, Mamoulis N, Kalnis P. Privacy preserving anonymization of set-valued data. In Proc. the 34th Very Large Data Bases Conf., Auckland, New Zealand, Aug. 2008, pp.115\u2013125.","DOI":"10.14778\/1453856.1453874"},{"key":"1203_CR8","doi-asserted-by":"crossref","unstructured":"Xu Y, Wang K, Fu A, Yu P S. Anonymizing transaction databases for publication. In Proc. the 14th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, Las Vegas, USA, August 2008, pp.767\u2013775.","DOI":"10.1145\/1401890.1401982"},{"key":"1203_CR9","doi-asserted-by":"crossref","unstructured":"Samarati P, Sweeney L. Generalizing data to provide anonymity when disclosing information. In Proc. ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Seattle, USA, June 1998, p.188.","DOI":"10.1145\/275487.275508"},{"key":"1203_CR10","unstructured":"Aggarwal C C. On k-anonymity and the curse of dimensionality. In Proc. the 31st Very Large Data Bases Conf., Trondheim, Norway, August 2005, pp.901\u2013909."},{"key":"1203_CR11","doi-asserted-by":"crossref","unstructured":"LeFevre K, DeWitt D, Ramakrishnan R. Mondrian multidimensional k-anonymity. In Proc. Int. Conf. Data Engineering, Atlanta, USA, April 2006, pp.25.","DOI":"10.1109\/ICDE.2006.101"},{"key":"1203_CR12","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K. On optimal anonymization for \u2113 +-diversity. In Proc. Int. Conf. Data Engineering, Long Beach, USA, March 2010, pp.213\u2013224.","DOI":"10.1109\/ICDE.2010.5447898"},{"key":"1203_CR13","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Gehrke J, Kifer D, Venkitasubramaniam M. \u2113-Diversity: Privacy beyond k-anonymity. In Proc. Int. Conf. Data Engineering, Atlanta, USA, April 2006, p.24.","DOI":"10.1109\/ICDE.2006.1"},{"key":"1203_CR14","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Gehrke J, G\u00f6tz M. Data publishing against realistic adversaries. In Proc. Very Large Data Bases Conf., Lyon, France, August 2009, pp.790\u2013801.","DOI":"10.14778\/1687627.1687717"},{"key":"1203_CR15","doi-asserted-by":"crossref","unstructured":"Martin D J, Kifer D, Machanavajjhala A, Gehrke J. Worst-case background knowledge for privacy preserving data publishing. In Proc. Int. Conf. Data Engineering, Istanbul, Turkey, April 2007, pp.126\u2013135.","DOI":"10.1109\/ICDE.2007.367858"},{"key":"1203_CR16","doi-asserted-by":"crossref","unstructured":"Cormode G, Srivastava D, Yu T, Zhang Q. Anonymizing bipartite graph data using safe groupings. In Proc. the 34th Very Large Data Bases Conf., Auckland, New Zealand, August 2008, pp.833\u2013844.","DOI":"10.14778\/1453856.1453947"},{"key":"1203_CR17","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Srikant R, Agrawal R, Gehrke J. Privacy preserving mining of association rules. In Proc. the 8th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, Edmonton, Canada, July 2002, pp.217\u2013228.","DOI":"10.1145\/775047.775080"},{"issue":"4","key":"1203_CR18","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TKDE.2004.1269668","volume":"16","author":"VS Verykios","year":"2004","unstructured":"Verykios V S, Elmagarmid A K, Bertino E, Saygin Y, Dasseni E. Association rule hiding. Trans. Knowledge and Data Engineering, April 2004, 16(4): 434\u2013447.","journal-title":"Trans. Knowledge and Data Engineering"},{"issue":"4","key":"1203_CR19","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s00778-006-0034-x","volume":"17","author":"M Atzori","year":"2008","unstructured":"Atzori M, Bonchi F, Giannotti F, Pedreschi D. Anonymity preserving pattern discovery. VLDB Journal, July 2008, 17(4):703\u2013727.","journal-title":"VLDB Journal"},{"key":"1203_CR20","doi-asserted-by":"crossref","unstructured":"Dwork C. Differential privacy. In Proc. the 33rd Int. Colloquium on Automata, Languages and Programming, Venice, Italy, July 2006, Part II, pp.1\u201312.","DOI":"10.1007\/11787006_1"},{"key":"1203_CR21","doi-asserted-by":"crossref","unstructured":"Korolova A, Kenthapadi K, Mishra N, Ntoulas A. Releasing search queries and clicks privately. In Proc. Int. World Wide Web Conf., Madrid, Spain, April 2009, pp.171\u2013180.","DOI":"10.1145\/1526709.1526733"},{"key":"1203_CR22","doi-asserted-by":"crossref","unstructured":"Xiao Y, Xiong L, Yuan C. Differentially private data release through multidimensional partitioning. In Secure Data Management Workshop at Very Large Data Bases Conf., Singapore, September 2010, pp.150\u2013168.","DOI":"10.1007\/978-3-642-15546-8_11"},{"key":"1203_CR23","doi-asserted-by":"crossref","unstructured":"Chen R, Mohammed N, Fung B C M, Desai B C, Xiong L. Publishing set-valued data via differential privacy. In Proc. the 37th Very Large Data Bases Conf., Seattle, USA, August 2011, pp.1087\u20131098.","DOI":"10.14778\/3402707.3402744"},{"key":"1203_CR24","doi-asserted-by":"crossref","unstructured":"Iyengar V. Transforming data to satisfy privacy constraints. In Proc. the 8th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, Edmonton, Canada, July 2002, pp.279\u2013288.","DOI":"10.1145\/775047.775089"},{"key":"1203_CR25","doi-asserted-by":"crossref","unstructured":"Xu J, Wang W, Pei J, Wang X, Shi B, Fu A. Utility-based anonymization using local recoding. In Proc. the 12th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, Philadelphia, USA, August 2006, pp.785\u2013790.","DOI":"10.1145\/1150402.1150504"},{"key":"1203_CR26","doi-asserted-by":"crossref","unstructured":"Bayardo R J, Agrawal R. Data privacy through optimal k-anonymization. In Proc. Int. Conf. Data Engineering, Tokyo, Japan, April 2005, pp.217\u2013228.","DOI":"10.1109\/ICDE.2005.42"},{"key":"1203_CR27","doi-asserted-by":"crossref","unstructured":"Zheng Z, Kohavi R, Mason L. Real world performance of association rule algorithms. In Proc. the 7th ACM SIGKDD Conf. Knowledge Discovery and Data Mining, San Francisco, USA, August 2001, pp.401\u2013406.","DOI":"10.1145\/502512.502572"},{"key":"1203_CR28","doi-asserted-by":"crossref","unstructured":"Xiao X, Tao Y. Anatomy: Simple and effective privacy preservation. In Proc. the 32nd Very Large Data Bases Conf., Seoul, Korea, Sept. 2006, pp.139\u2013150.","DOI":"10.1145\/1142473.1142500"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1203-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1203-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1203-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T16:57:25Z","timestamp":1742317045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1203-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["1203"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1203-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}