{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:14:24Z","timestamp":1775081664639,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,10]]},"DOI":"10.1145\/3298689.3347013","type":"proceedings-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T13:21:31Z","timestamp":1568208091000},"page":"78-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient privacy-preserving recommendations based on social graphs"],"prefix":"10.1145","author":[{"given":"Aidmar","family":"Wainakh","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Grube","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Daubert","sequence":"additional","affiliation":[{"name":"Philipps-Universit\u00e4t Marburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"M\u00fchlh\u00e4user","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5899\/2017\/jsca-00073"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375602"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 20th int. conf. very large data bases, VLDB","volume":"1215","author":"Agrawal Rakesh","year":"1994","unstructured":"Rakesh Agrawal , Ramakrishnan Srikant , 1994 . Fast algorithms for mining association rules . In Proc. 20th int. conf. very large data bases, VLDB , Vol. 1215 . 487--499. Rakesh Agrawal, Ramakrishnan Srikant, et al. 1994. Fast algorithms for mining association rules. In Proc. 20th int. conf. very large data bases, VLDB, Vol. 1215. 487--499."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935845"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40994-3_29"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-017-0743-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514927"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_59"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647597.731877"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774216"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.09.001"},{"key":"e_1_3_2_1_12_1","first-page":"68","article-title":"The False Prophecy of Hyperconnection: How to Survive the Networked Age","volume":"96","author":"Ferguson Niall","year":"2017","unstructured":"Niall Ferguson . 2017 . The False Prophecy of Hyperconnection: How to Survive the Networked Age . Foreign Aff. 96 (2017), 68 . Niall Ferguson. 2017. The False Prophecy of Hyperconnection: How to Survive the Networked Age. Foreign Aff. 96 (2017), 68.","journal-title":"Foreign Aff."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT.2014.86"},{"key":"e_1_3_2_1_14_1","volume-title":"Facebook to contact 87 million users affected by data breach. {Online","author":"Guardian The","year":"2018","unstructured":"The Guardian . 2018. Facebook to contact 87 million users affected by data breach. {Online ; accessed 11- Dec- 2018 }. The Guardian. 2018. Facebook to contact 87 million users affected by data breach. {Online; accessed 11-Dec-2018}."},{"key":"e_1_3_2_1_15_1","volume-title":"Huge Facebook breach leaves thousands of other apps vulnerable. {Online","author":"Guardian The","year":"2018","unstructured":"The Guardian . 2018. Huge Facebook breach leaves thousands of other apps vulnerable. {Online ; accessed 11- Dec- 2018 }. The Guardian. 2018. Huge Facebook breach leaves thousands of other apps vulnerable. {Online; accessed 11-Dec-2018}."},{"key":"e_1_3_2_1_16_1","volume-title":"M V P Chandra Sekhara Rao, and B Janakiramaiah","author":"Kalyani G","year":"2017","unstructured":"G Kalyani , M V P Chandra Sekhara Rao, and B Janakiramaiah . 2017 . Particle Swarm Intelligence and Impact Factor-Based Privacy Preserving Association Rule Mining for Balancing Data Utility and Knowledge Privacy . Arabian Journal for Science and Engineering (2017). G Kalyani, M V P Chandra Sekhara Rao, and B Janakiramaiah. 2017. Particle Swarm Intelligence and Impact Factor-Based Privacy Preserving Association Rule Mining for Balancing Data Utility and Knowledge Privacy. Arabian Journal for Science and Engineering (2017)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_3_2_1_18_1","first-page":"71","article-title":"Association Rules Mining: A Recent Overview","volume":"32","author":"Kotsiantis Sotiris","year":"2006","unstructured":"Sotiris Kotsiantis and Dimitris Kanellopoulos . 2006 . Association Rules Mining: A Recent Overview . Greece - Science 32 , 1 (2006), 71 -- 82 . Sotiris Kotsiantis and Dimitris Kanellopoulos. 2006. Association Rules Mining: A Recent Overview. Greece - Science 32, 1 (2006), 71--82.","journal-title":"Greece - Science"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.09.059"},{"key":"e_1_3_2_1_21_1","volume-title":"Breast Cancer Wisconsin (Diagnostic) Data Set. {Online","author":"MultiMedia LLC.","year":"2018","unstructured":"MultiMedia LLC. 1995. Breast Cancer Wisconsin (Diagnostic) Data Set. {Online ; accessed 11- Dec- 2018 }. MultiMedia LLC. 1995. Breast Cancer Wisconsin (Diagnostic) Data Set. {Online; accessed 11-Dec-2018}."},{"key":"e_1_3_2_1_22_1","volume-title":"World's Biggest Data Breaches & Hacks. {Online","author":"McCandless David","year":"2019","unstructured":"David McCandless . 2019. World's Biggest Data Breaches & Hacks. {Online ; accessed 02- Jan- 2019 }. David McCandless. 2019. World's Biggest Data Breaches & Hacks. {Online; accessed 02-Jan-2019}."},{"key":"e_1_3_2_1_23_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology 27, 1","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson , Lynn Smith-Lovin , and James M Cook . 2001. Birds of a feather: Homophily in social networks. Annual review of sociology 27, 1 ( 2001 ), 415--444. Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology 27, 1 (2001), 415--444."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022850703159"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/850782.850789"},{"key":"e_1_3_2_1_27_1","volume-title":"Efficient progressive sampling for association rules. In null","author":"Parthasarathy Srinivasan","unstructured":"Srinivasan Parthasarathy . 2002. Efficient progressive sampling for association rules. In null . IEEE , 354. Srinivasan Parthasarathy. 2002. Efficient progressive sampling for association rules. In null. IEEE, 354."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195540"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.39"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.41"},{"key":"e_1_3_2_1_33_1","first-page":"134","article-title":"Sampling large databases for association rules","volume":"96","author":"Toivonen Hannu","year":"1996","unstructured":"Hannu Toivonen . 1996 . Sampling large databases for association rules . In VLDB , Vol. 96. 134 -- 145 . Hannu Toivonen. 1996. Sampling large databases for association rules. In VLDB, Vol. 96. 134--145.","journal-title":"VLDB"},{"key":"e_1_3_2_1_34_1","unstructured":"Theja Tulabandhula Shailesh Vaya and Aritra Dhar. 2017. Privacy-preserving Targeted Advertising. (2017) 1--16. arXiv:1710.03275 http:\/\/arxiv.org\/abs\/1710.03275  Theja Tulabandhula Shailesh Vaya and Aritra Dhar. 2017. Privacy-preserving Targeted Advertising. (2017) 1--16. arXiv:1710.03275 http:\/\/arxiv.org\/abs\/1710.03275"},{"key":"e_1_3_2_1_35_1","volume-title":"The value of influencers on Twitter. {Online","author":"Annalect Twitter","year":"2019","unstructured":"Twitter and Annalect . 2016. The value of influencers on Twitter. {Online ; accessed 18- Apr- 2019 }. Twitter and Annalect. 2016. The value of influencers on Twitter. {Online; accessed 18-Apr-2019}."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Yongqing Wang and Yan Chen. 2012. ANew Association Rules Mining Method based on Ontology Theory. (2012).  Yongqing Wang and Yan Chen. 2012. ANew Association Rules Mining Method based on Ontology Theory. (2012).","DOI":"10.1109\/ICACI.2012.6463170"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.07.016"},{"key":"e_1_3_2_1_39_1","volume-title":"A Scalable Algorithm for Privacy-Preserving Item-based Top-N Recommendation. arXiv preprint arXiv:1811.02217","author":"Zhao Yingying","year":"2018","unstructured":"Yingying Zhao , Dongsheng Li , Qin Lv , and Li Shang . 2018. A Scalable Algorithm for Privacy-Preserving Item-based Top-N Recommendation. arXiv preprint arXiv:1811.02217 ( 2018 ). Yingying Zhao, Dongsheng Li, Qin Lv, and Li Shang. 2018. A Scalable Algorithm for Privacy-Preserving Item-based Top-N Recommendation. arXiv preprint arXiv:1811.02217 (2018)."}],"event":{"name":"RecSys '19: Thirteenth ACM Conference on Recommender Systems","location":"Copenhagen Denmark","acronym":"RecSys '19"},"container-title":["Proceedings of the 13th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3347013","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3298689.3347013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:55Z","timestamp":1750201975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3347013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":39,"alternative-id":["10.1145\/3298689.3347013","10.1145\/3298689"],"URL":"https:\/\/doi.org\/10.1145\/3298689.3347013","relation":{},"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"2019-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}