{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T22:57:05Z","timestamp":1753052225112,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science Foundation of Guangdong Province of China","award":["2019A1515011705"],"award-info":[{"award-number":["2019A1515011705"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61906185"],"award-info":[{"award-number":["61906185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Youth Innovation Promotion Association of CAS China","award":["2020357"],"award-info":[{"award-number":["2020357"]}]},{"name":"Shenzhen Basic Research Foundation","award":["JCYJ20210324115614039"],"award-info":[{"award-number":["JCYJ20210324115614039"]}]},{"name":"Shenzhen Science and Technology Innovation Program","award":["KQTD20190929172835662"],"award-info":[{"award-number":["KQTD20190929172835662"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3531773","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:13Z","timestamp":1657206733000},"page":"1895-1900","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing Top-N Item Recommendations by Peer Collaboration"],"prefix":"10.1145","author":[{"given":"Yang","family":"Sun","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fajie","family":"Yuan","sequence":"additional","affiliation":[{"name":"Westlake University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Yang","sequence":"additional","affiliation":[{"name":"Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros","family":"Karatzoglou","sequence":"additional","affiliation":[{"name":"Google Research, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Shen","sequence":"additional","affiliation":[{"name":"JD Explore Academy, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhao","sequence":"additional","affiliation":[{"name":"Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052694"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437792"},{"key":"e_1_3_2_2_5_1","volume-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635","author":"Frankle Jonathan","year":"2018","unstructured":"Jonathan Frankle and Michael Carbin . 2018. The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635 ( 2018 ). Jonathan Frankle and Michael Carbin. 2018. The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635 (2018)."},{"key":"e_1_3_2_2_6_1","volume-title":"Compressing BERT: Studying the effects of weight pruning on transfer learning. arXiv preprint arXiv:2002.08307","author":"Gordon Mitchell A","year":"2020","unstructured":"Mitchell A Gordon , Kevin Duh , and Nicholas Andrews . 2020. Compressing BERT: Studying the effects of weight pruning on transfer learning. arXiv preprint arXiv:2002.08307 ( 2020 ). Mitchell A Gordon, Kevin Duh, and Nicholas Andrews. 2020. Compressing BERT: Studying the effects of weight pruning on transfer learning. arXiv preprint arXiv:2002.08307 (2020)."},{"key":"e_1_3_2_2_7_1","volume":"2015","author":"Han Song","unstructured":"Song Han , Huizi Mao , and William J Dally. 2015 a. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015). Song Han, Huizi Mao, and William J Dally. 2015a. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015).","journal-title":"William J Dally."},{"key":"e_1_3_2_2_8_1","volume":"2015","author":"Han Song","unstructured":"Song Han , Jeff Pool , John Tran , and William J Dally. 2015 b. Learning both weights and connections for efficient neural networks. arXiv preprint arXiv:1506.02626 (2015). Song Han, Jeff Pool, John Tran, and William J Dally. 2015b. Learning both weights and connections for efficient neural networks. arXiv preprint arXiv:1506.02626 (2015).","journal-title":"William J Dally."},{"key":"e_1_3_2_2_9_1","volume-title":"Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939","author":"Hidasi Bal\u00e1zs","year":"2015","unstructured":"Bal\u00e1zs Hidasi , Alexandros Karatzoglou , Linas Baltrunas , and Domonkos Tikk . 2015. Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939 ( 2015 ). Bal\u00e1zs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk. 2015. Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939 (2015)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505665"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00035"},{"key":"e_1_3_2_2_12_1","volume-title":"Albert: A lite bert for self-supervised learning of language representations. arXiv preprint arXiv:1909.11942","author":"Lan Zhenzhong","year":"2019","unstructured":"Zhenzhong Lan , Mingda Chen , Sebastian Goodman , Kevin Gimpel , Piyush Sharma , and Radu Soricut . 2019 . Albert: A lite bert for self-supervised learning of language representations. arXiv preprint arXiv:1909.11942 (2019). Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Soricut. 2019. Albert: A lite bert for self-supervised learning of language representations. arXiv preprint arXiv:1909.11942 (2019)."},{"key":"e_1_3_2_2_13_1","volume-title":"Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710","author":"Li Hao","year":"2016","unstructured":"Hao Li , Asim Kadav , Igor Durdanovic , Hanan Samet , and Hans Peter Graf . 2016. Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 ( 2016 ). Hao Li, Asim Kadav, Igor Durdanovic, Hanan Samet, and Hans Peter Graf. 2016. Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 (2016)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00663"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262855"},{"key":"e_1_3_2_2_16_1","volume-title":"Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. 452--461","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle , Christoph Freudenthaler , Zeno Gantner , and Lars Schmidt-Thieme . 2009 . BPR: Bayesian personalized ranking from implicit feedback . In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. 452--461 . Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. 452--461."},{"key":"e_1_3_2_2_17_1","volume-title":"Ensemble-based classifiers. Artificial intelligence review","author":"Rokach Lior","year":"2010","unstructured":"Lior Rokach . 2010. Ensemble-based classifiers. Artificial intelligence review , Vol. 33 , 1--2 ( 2010 ), 1--39. Lior Rokach. 2010. Ensemble-based classifiers. Artificial intelligence review, Vol. 33, 1--2 (2010), 1--39."},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning. 291--301","author":"Luong Minh-Thang","year":"2016","unstructured":"Abigail See, Minh-Thang Luong , and Christopher D Manning . 2016 . Compression of Neural Machine Translation Models via Pruning . In Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning. 291--301 . Abigail See, Minh-Thang Luong, and Christopher D Manning. 2016. Compression of Neural Machine Translation Models via Pruning. In Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning. 291--301."},{"key":"e_1_3_2_2_19_1","volume-title":"Opening the black box of deep neural networks via information. arXiv preprint arXiv:1703.00810","author":"Shwartz-Ziv Ravid","year":"2017","unstructured":"Ravid Shwartz-Ziv and Naftali Tishby . 2017. Opening the black box of deep neural networks via information. arXiv preprint arXiv:1703.00810 ( 2017 ). Ravid Shwartz-Ziv and Naftali Tishby. 2017. Opening the black box of deep neural networks via information. arXiv preprint arXiv:1703.00810 (2017)."},{"key":"e_1_3_2_2_20_1","volume-title":"Rob R De Ruyter Van Steveninck, and William Bialek","author":"Strong Steven P","year":"1998","unstructured":"Steven P Strong , Roland Koberle , Rob R De Ruyter Van Steveninck, and William Bialek . 1998 . Entropy and information in neural spike trains. Physical review letters, Vol. 80 , 1 (1998), 197. Steven P Strong, Roland Koberle, Rob R De Ruyter Van Steveninck, and William Bialek. 1998. Entropy and information in neural spike trains. Physical review letters, Vol. 80, 1 (1998), 197."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357895"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401125"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462890"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380116"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290975"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462884"}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Madrid Spain","acronym":"SIGIR '22"},"container-title":["Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3531773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3531773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:25Z","timestamp":1750183825000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3531773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":26,"alternative-id":["10.1145\/3477495.3531773","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3531773","relation":{},"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"2022-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}