{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:10:41Z","timestamp":1742969441845,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811590306"},{"type":"electronic","value":"9789811590313"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-9031-3_28","type":"book-chapter","created":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T07:04:29Z","timestamp":1601017469000},"page":"318-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Movie Recommendation System Based on Differential Privacy"],"prefix":"10.1007","author":[{"given":"Min","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingming","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"28_CR1","unstructured":"Chaudhuri, K., Sarwate, A., Sinha, K.: Near-optimal differentially private principal components. In: NIPS, pp. 989\u2013997 (2012)"},{"key":"28_CR2","unstructured":"Chaudhuri, K., Vinterbo, S.A.: A stability-based validation procedure for differentially private machine learning. In: NIPS, pp. 2652\u20132660 (2013)"},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1749603.1749605","volume":"42","author":"BCM Fung","year":"2010","unstructured":"Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 14:1\u201314:53 (2010)","journal-title":"ACM Comput. Surv."},{"key":"28_CR4","unstructured":"Thakurta, A.G., Smith, A.: (Nearly) optimal algorithms for private online learning in full-information and bandit settings. In: NIPS, pp. 2733\u20132741 (2013)"},{"key":"28_CR5","unstructured":"Hardt, M., Ligett, K., Mcsherry, F.: A simple and practical algorithm for differentially private data release. In: NIPS, pp. 2339\u20132347 (2012)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"McSherry, F., Mironov, I.: Differentially private recommender systems: building privacy into the net. In: KDD, pp. 627\u2013636 (2009)","DOI":"10.1145\/1557019.1557090"},{"issue":"07","key":"28_CR7","first-page":"159","volume":"29","author":"Q Ye","year":"2018","unstructured":"Ye, Q., Meng, X., Zhu, M., et al.: A review of localized differential privacy. J. Softw. 29(07), 159\u2013183 (2018)","journal-title":"J. Softw."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11761679_29"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11681878_14"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Mcsherry, F., Talwar, K.: The price of privacy and the limits of LP decoding. ACM Symposium on Theory of Computing. ACM (2007)","DOI":"10.1145\/1250790.1250804"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2018.04.026","volume":"732","author":"S V\u00e1gv\u00f6lgyi","year":"2018","unstructured":"V\u00e1gv\u00f6lgyi, S.: Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy. Theor. Comput. Sci. 732, 60\u201372 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1\/2","key":"28_CR12","first-page":"1021","volume":"3","author":"M Hay","year":"2009","unstructured":"Hay, M., Rastogi, V., Miklau, G., et al.: Boosting the accuracy of differentially private histograms through consistency. Proc. VLDB Endow. 3(1\/2), 1021\u20131032 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Chen, R., Fung, B.C.M., Desai, B.C.: Differentially private transit data publication: a case study on the Montreal transportation system. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 213\u2013221. ACM, New York (2012)","DOI":"10.1145\/2339530.2339564"},{"issue":"02","key":"28_CR14","first-page":"134","volume":"51","author":"T Shang","year":"2019","unstructured":"Shang, T., Zhao, Z., Shu, W., et al.: Algorithm of big data decision tree based on isometric privacy budget allocation. Eng. Sci. Technol. 51(02), 134\u2013140 (2019)","journal-title":"Eng. Sci. Technol."},{"issue":"07","key":"28_CR15","first-page":"1960","volume":"38","author":"X Wang","year":"2008","unstructured":"Wang, X., Han, H., Zhang, Z., Yu, Q., Zheng, X.: Budget allocation method for tree index data differential privacy. Comput. Appl. 38(07), 1960\u20131966 (2008)","journal-title":"Comput. Appl."},{"issue":"03","key":"28_CR16","first-page":"76","volume":"40","author":"H Demin","year":"2019","unstructured":"Demin, H., Liao, Z.: Differential privacy location privacy protection method for m-fork average tree. J. Small Micro Comput. Syst. 40(03), 76\u201382 (2019)","journal-title":"J. Small Micro Comput. Syst."}],"container-title":["Communications in Computer and Information Science","Security and Privacy in Social Networks and Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-9031-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T07:17:39Z","timestamp":1601018259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-9031-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811590306","9789811590313"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-9031-3_28","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SocialSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Security and Privacy in Social Networks and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socialsec2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/socialsec2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}