{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T14:51:27Z","timestamp":1781189487146,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,27]]},"DOI":"10.1145\/1142473.1142499","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"217-228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":154,"title":["Injecting utility into anonymized datasets"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Kifer","sequence":"first","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Gehrke","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/76894.76895"},{"key":"e_1_3_2_1_2_1","first-page":"901","volume-title":"VLDB","author":"Aggarwal Charu C.","year":"2005","unstructured":"Charu C. Aggarwal . On k-anonymity and the curse of dimensionality . In VLDB , pages 901 -- 909 , 2005 .]] Charu C. Aggarwal. On k-anonymity and the curse of dimensionality. In VLDB, pages 901--909, 2005.]]"},{"key":"e_1_3_2_1_3_1","volume-title":"Journal of Privacy Technology (JOPT)","author":"Aggarwal G.","year":"2005","unstructured":"G. Aggarwal , T. Feder , K. Kenthapadi , R. Motwani , R. Panigrahy , D. Thomas , and A. Zhu . Approximation algorithms for k-anonymity . Journal of Privacy Technology (JOPT) , 2005 .]] G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation algorithms for k-anonymity. Journal of Privacy Technology (JOPT), 2005.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375602"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.42"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/234285.234289"},{"key":"e_1_3_2_1_8_1","first-page":"217","volume-title":"When is \"nearest neighbor\" meaningful? In ICDT","author":"Beyer Kevin S.","year":"1999","unstructured":"Kevin S. Beyer , Jonathan Goldstein , Raghu Ramakrishnan , and Uri Shaft . When is \"nearest neighbor\" meaningful? In ICDT , pages 217 -- 235 , 1999 .]] Kevin S. Beyer, Jonathan Goldstein, Raghu Ramakrishnan, and Uri Shaft. When is \"nearest neighbor\" meaningful? In ICDT, pages 217--235, 1999.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_20"},{"key":"e_1_3_2_1_10_1","volume-title":"Log-Linear Models and Logistic Regression","author":"Christensen Ronald","year":"1997","unstructured":"Ronald Christensen . Log-Linear Models and Logistic Regression . Springer-Verlag , 1997 .]] Ronald Christensen. Log-Linear Models and Logistic Regression. Springer-Verlag, 1997.]]"},{"key":"e_1_3_2_1_11_1","first-page":"75","article-title":"Suppression, methodology and statistical disclosure control","author":"Cox L. H.","year":"1980","unstructured":"L. H. Cox . Suppression, methodology and statistical disclosure control . Journal of the American Statistical Association , 75 , 1980 .]] L. H. Cox. Suppression, methodology and statistical disclosure control. Journal of the American Statistical Association, 75, 1980.]]","journal-title":"Journal of the American Statistical Association"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(82)90058-1"},{"key":"e_1_3_2_1_13_1","first-page":"128","volume-title":"UAI","author":"Deshpande Amol","year":"2001","unstructured":"Amol Deshpande , Minos N. Garofalakis , and Michael I. Jordan . Efficient stepwise selection in decomposable models . In UAI , pages 128 -- 135 , 2001 .]] Amol Deshpande, Minos N. Garofalakis, and Michael I. Jordan. Efficient stepwise selection in decomposable models. In UAI, pages 128--135, 2001.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775089"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-332-5.50050-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065183"},{"key":"e_1_3_2_1_20_1","volume-title":"Oxford Science Publications","author":"Lauritzen S. L.","year":"1996","unstructured":"S. L. Lauritzen . Graphical Models . Oxford Science Publications , 1996 .]] S. L. Lauritzen. Graphical Models. Oxford Science Publications, 1996.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403803"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.120082"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055591"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007633"},{"key":"e_1_3_2_1_27_1","volume-title":"Learning Bayesian Networks","author":"Neapolitan Richard E.","year":"2000","unstructured":"Richard E. Neapolitan . Learning Bayesian Networks . Prentice Hall , December 2000 .]] Richard E. Neapolitan. Learning Bayesian Networks. Prentice Hall, December 2000.]]"},{"key":"e_1_3_2_1_28_1","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl Judea","year":"1988","unstructured":"Judea Pearl . Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 1988 .]] Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988.]]"},{"key":"e_1_3_2_1_29_1","unstructured":"U.C.Irvine Machine Learning Repository. http:\/\/www.ics.uci.edu\/ mlearn\/mlrepository.html.]]  U.C.Irvine Machine Learning Repository. http:\/\/www.ics.uci.edu\/ mlearn\/mlrepository.html.]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"key":"e_1_3_2_1_31_1","volume-title":"SRI","author":"Samarati P.","year":"1998","unstructured":"P. Samarati and L. Sweeney . Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, CMU , SRI , 1998 .]] P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, CMU, SRI, 1998.]]"},{"key":"e_1_3_2_1_32_1","volume-title":"VLDB","author":"Sarawagi Sunita","year":"2000","unstructured":"Sunita Sarawagi . User-adaptive exploration of multidimensional data . In VLDB , 2000 .]] Sunita Sarawagi. User-adaptive exploration of multidimensional data. In VLDB, 2000.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.142"},{"key":"e_1_3_2_1_35_1","volume-title":"Biometrics","author":"Wermuth Nanny","year":"1976","unstructured":"Nanny Wermuth . Model search among multiplicative models . Biometrics , 1976 .]] Nanny Wermuth. Model search among multiplicative models. Biometrics, 1976.]]"}],"event":{"name":"SIGMOD\/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Chicago IL USA","acronym":"SIGMOD\/PODS06","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2006 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142473.1142499","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1142473.1142499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:19Z","timestamp":1750259179000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142473.1142499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":34,"alternative-id":["10.1145\/1142473.1142499","10.1145\/1142473"],"URL":"https:\/\/doi.org\/10.1145\/1142473.1142499","relation":{},"subject":[],"published":{"date-parts":[[2006,6,27]]},"assertion":[{"value":"2006-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}