{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T16:21:42Z","timestamp":1784391702133,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557090","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"627-636","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":454,"title":["Differentially private recommender systems"],"prefix":"10.1145","author":[{"given":"Frank","family":"McSherry","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilya","family":"Mironov","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"901","volume-title":"K. Bohm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-A","author":"Aggarwal C. C.","year":"2005","unstructured":"C. C. Aggarwal . On k-anonymity and the curse of dimensionality . In K. Bohm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-A . Larson, and B. C. Ooi, editors, VLDB, pages 901 -- 909 . ACM , 2005 . C. C. Aggarwal. On k-anonymity and the curse of dimensionality. In K. Bohm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-A. Larson, and B. C. Ooi, editors, VLDB, pages 901--909. ACM, 2005."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-007-0049-3"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARES.2008.193"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.90"},{"key":"e_1_3_2_2_5_1","volume-title":"The BellKor solution to the Netflix Prize. Available from http:\/\/www.netflixprize.com","author":"Bell R. M.","year":"2007","unstructured":"R. M. Bell , Y. Koren , and C. Volinsky . The BellKor solution to the Netflix Prize. Available from http:\/\/www.netflixprize.com , 2007 . R. M. Bell, Y. Koren, and C. Volinsky. The BellKor solution to the Netflix Prize. Available from http:\/\/www.netflixprize.com, 2007."},{"key":"e_1_3_2_2_6_1","volume-title":"The BellKor 2008 solution to the Netflix Prize. Available from http:\/\/www.netflixprize.com","author":"Bell R. M.","year":"2008","unstructured":"R. M. Bell , Y. Koren , and C. Volinsky . The BellKor 2008 solution to the Netflix Prize. Available from http:\/\/www.netflixprize.com , 2008 . R. M. Bell, Y. Koren, and C. Volinsky. The BellKor 2008 solution to the Netflix Prize. Available from http:\/\/www.netflixprize.com, 2008."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401904"},{"key":"e_1_3_2_2_9_1","volume-title":"Manuscript","author":"Calandrino J.","year":"2009","unstructured":"J. Calandrino , A. Narayanan , E. Felten , and V. Shmatikov . Don't review that book: Privacy risks of collaborative filtering . Manuscript , 2009 . J. Calandrino, A. Narayanan, E. Felten, and V. Shmatikov. Don't review that book: Privacy risks of collaborative filtering. Manuscript, 2009."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/829514.830525"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564419"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.61"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"C.\n      Dwork\n    .\n  An ad omnia approach to defining and achieving private data analysis\n  . In F. Bonchi E. Ferrari B. Malin and Y. Saygin editors PinKDD volume \n  4890\n   of \n  Lecture Notes in Computer Science pages \n  1\n  --\n  13\n  . \n  Springer 2007\n  .   C. Dwork. An ad omnia approach to defining and achieving private data analysis. In F. Bonchi E. Ferrari B. Malin and Y. Saygin editors PinKDD volume 4890 of Lecture Notes in Computer Science pages 1--13. Springer 2007.","DOI":"10.1007\/978-3-540-78478-4_1"},{"key":"e_1_3_2_2_15_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"M. Agrawal, D.-Z. Du","author":"Dwork C.","year":"2008","unstructured":"C. Dwork . Differential privacy: A survey of results . In M. Agrawal, D.-Z. Du , Z. Duan, and A. Li, editors, Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008 , Xi'an, China, April 25-29, 2008. Proceedings, volume 4978 of Lecture Notes in Computer Science , pages 1 -- 19 . Springer , 2008. C. Dwork. Differential privacy: A survey of results. In M. Agrawal, D.-Z. Du, Z. Duan, and A. Li, editors, Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, volume 4978 of Lecture Notes in Computer Science, pages 1--19. Springer, 2008."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401926"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497436"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557090","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:41Z","timestamp":1750253921000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557090"}},"subtitle":["Building privacy into the Netflix Prize contenders"],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":23,"alternative-id":["10.1145\/1557019.1557090","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557090","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}