{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:55:22Z","timestamp":1776084922251,"version":"3.50.1"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T00:00:00Z","timestamp":1495670400000},"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":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>We propose a privacy-enhanced matrix factorization recommender that exploits the fact that users can often be grouped together by interest. This allows a form of \u201chiding in the crowd\u201d privacy. We introduce a novel matrix factorization approach suited to making recommendations in a shared group (or \u201cnym\u201d) setting and the BLC algorithm for carrying out this matrix factorization in a privacy-enhanced manner. We demonstrate that the increased privacy does not come at the cost of reduced recommendation accuracy.<\/jats:p>","DOI":"10.1145\/3041760","type":"journal-article","created":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T16:16:45Z","timestamp":1495729005000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["BLC"],"prefix":"10.1145","volume":"20","author":[{"given":"Alessandro","family":"Checco","sequence":"first","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Bianchi","sequence":"additional","affiliation":[{"name":"School of Engineering, Universit\u00e0 di Roma \u201cTor Vergata,\u201d Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas J.","family":"Leith","sequence":"additional","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083696"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335438"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-007-0049-3"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 29th International Conference on Machine Learning (ICML\u201912)","author":"Avron Haim","unstructured":"Haim Avron , Satyen Kale , Vikas Sindhwani , and Shiva P. Kasiviswanathan . 2012. Efficient and practical stochastic subgradient descent for nuclear norm regularization . In Proceedings of the 29th International Conference on Machine Learning (ICML\u201912) . 1231--1238. Haim Avron, Satyen Kale, Vikas Sindhwani, and Shiva P. Kasiviswanathan. 2012. Efficient and practical stochastic subgradient descent for nuclear norm regularization. In Proceedings of the 29th International Conference on Machine Learning (ICML\u201912). 1231--1238."},{"key":"e_1_2_1_5_1","volume-title":"Probability and Measure","author":"Billingsley Patrick","unstructured":"Patrick Billingsley . 2008. Probability and Measure . John Wiley 8 Sons. Patrick Billingsley. 2008. Probability and Measure. John Wiley 8 Sons."},{"key":"e_1_2_1_6_1","volume-title":"Information Retrieval and Mining in Distributed Environments. Studies in Computational Intelligence","author":"Boratto Ludovico","unstructured":"Ludovico Boratto and Salvatore Carta . 2011. State-of-the-art in group recommendation and new approaches for automatic identification of groups . In Information Retrieval and Mining in Distributed Environments. Studies in Computational Intelligence , Vol. 324 . Springer , 1--20. Ludovico Boratto and Salvatore Carta. 2011. State-of-the-art in group recommendation and new approaches for automatic identification of groups. In Information Retrieval and Mining in Distributed Environments. Studies in Computational Intelligence, Vol. 324. Springer, 1--20."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.40"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/829514.830525"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/88314.88969"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_13"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150420"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CASoN.2010.139"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_2_1_14_1","volume-title":"Applied Regression Analysis","author":"Draper Norman Richard","unstructured":"Norman Richard Draper , Harry Smith , and Elizabeth Pownell . 1966. Applied Regression Analysis . Vol. 3 . Wiley , New York, NY . Norman Richard Draper, Harry Smith, and Elizabeth Pownell. 1966. Applied Regression Analysis. Vol. 3. Wiley, New York, NY."},{"key":"e_1_2_1_15_1","unstructured":"S. Funk. 2006. Stochastic gradient descent. Retrieved from http:\/\/sifter.org\/simon\/journal\/20061211.html.  S. Funk. 2006. Stochastic gradient descent. Retrieved from http:\/\/sifter.org\/simon\/journal\/20061211.html."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488432"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 8th USENIX NSDI Symposium.","author":"Guha Saikat","year":"2011","unstructured":"Saikat Guha , Bin Cheng , and Paul Francis . 2011 . Privad: Practical privacy in online advertising . In Proceedings of the 8th USENIX NSDI Symposium. Saikat Guha, Bin Cheng, and Paul Francis. 2011. Privad: Practical privacy in online advertising. In Proceedings of the 8th USENIX NSDI Symposium."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963774"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066163"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3104322.3104383"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0710-2"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952160"},{"key":"e_1_2_1_23_1","first-page":"446","article-title":"Group recommendations: Survey and perspectives","volume":"33","author":"Kompan Michal","year":"2013","unstructured":"Michal Kompan and Maria Bielikova . 2013 . Group recommendations: Survey and perspectives . Comput. Inform. 33 , 2 (2013), 446 -- 476 . Michal Kompan and Maria Bielikova. 2013. Group recommendations: Survey and perspectives. Comput. Inform. 33, 2 (2013), 446--476.","journal-title":"Comput. Inform."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988726"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2011.136"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859931"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the Hot Topics in Privacy Enhancing Technologies Symposium.","author":"Nandi Animesh","year":"2011","unstructured":"Animesh Nandi , Armen Aghasaryan , and Makram Bouzid . 2011 . P3: A privacy preserving personalization middleware for recommendation-based services . In Proceedings of the Hot Topics in Privacy Enhancing Technologies Symposium. Animesh Nandi, Armen Aghasaryan, and Makram Bouzid. 2011. P3: A privacy preserving personalization middleware for recommendation-based services. In Proceedings of the Hot Topics in Privacy Enhancing Technologies Symposium."},{"key":"e_1_2_1_30_1","volume-title":"How to break anonymity of the Netflix prize dataset. arXiv Preprint cs\/0610105","author":"Narayanan Arvind","year":"2006","unstructured":"Arvind Narayanan and Vitaly Shmatikov . 2006. How to break anonymity of the Netflix prize dataset. arXiv Preprint cs\/0610105 ( 2006 ). Arvind Narayanan and Vitaly Shmatikov. 2006. How to break anonymity of the Netflix prize dataset. arXiv Preprint cs\/0610105 (2006)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11184"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of ECSCW","author":"O\u2019Connor Mark","year":"2001","unstructured":"Mark O\u2019Connor , Dan Cosley , Joseph A. Konstan , and John Riedl . 2001 . PolyLens: A recommender system for groups of users . In Proceedings of ECSCW 2001. 199--218. Mark O\u2019Connor, Dan Cosley, Joseph A. Konstan, and John Riedl. 2001. PolyLens: A recommender system for groups of users. In Proceedings of ECSCW 2001. 199--218."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066677.1066860"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML\u201911)","author":"Shalev-Shwartz Shai","year":"2011","unstructured":"Shai Shalev-Shwartz , Alon Gonen , and Ohad Shamir . 2011 . Large-scale convex minimization with a low-rank constraint . In Proceedings of the 28th International Conference on Machine Learning (ICML\u201911) . 329--336. Shai Shalev-Shwartz, Alon Gonen, and Ohad Shamir. 2011. Large-scale convex minimization with a low-rank constraint. In Proceedings of the 28th International Conference on Machine Learning (ICML\u201911). 329--336."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2011.150"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639741"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11766155_2"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2011.05.025"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_41_1","volume-title":"AAAI Workshop on Recommendation Systems","volume":"1","author":"Lyle","unstructured":"Lyle H. Ungar and Dean P. Foster. 1998. Clustering methods for collaborative filtering . In AAAI Workshop on Recommendation Systems , Vol. 1 . 114--129. Lyle H. Ungar and Dean P. Foster. 1998. Clustering methods for collaborative filtering. In AAAI Workshop on Recommendation Systems, Vol. 1. 114--129."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348335"},{"key":"e_1_2_1_43_1","unstructured":"Yu Xin and Tommi Jaakkola. 2014. Controlling privacy in recommender systems. In Advances in Neural Information Processing Systems. 2618--2626.   Yu Xin and Tommi Jaakkola. 2014. Controlling privacy in recommender systems. In Advances in Neural Information Processing Systems. 2618--2626."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076056"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 25th International Conference on Computational Linguistics: Technical Papers (COLING\u201914)","author":"Zhou Guangyou","year":"2014","unstructured":"Guangyou Zhou , Yubo Chen , Daojian Zeng , and Jun Zhao . 2014 . Group non-negative matrix factorization with natural categories for question retrieval in community question answer archives . In Proceedings of the 25th International Conference on Computational Linguistics: Technical Papers (COLING\u201914) . Guangyou Zhou, Yubo Chen, Daojian Zeng, and Jun Zhao. 2014. Group non-negative matrix factorization with natural categories for question retrieval in community question answer archives. In Proceedings of the 25th International Conference on Computational Linguistics: Technical Papers (COLING\u201914)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-014-5454-z"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3041760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:52Z","timestamp":1750220632000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041760"}},"subtitle":["Private Matrix Factorization Recommenders via Automatic Group Learning"],"short-title":[],"issued":{"date-parts":[[2017,5,25]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/3041760"],"URL":"https:\/\/doi.org\/10.1145\/3041760","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,25]]},"assertion":[{"value":"2016-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-05-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}