{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:04Z","timestamp":1750220284367,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1145\/3487572.3487598","type":"proceedings-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T15:27:46Z","timestamp":1637594866000},"page":"34-38","source":"Crossref","is-referenced-by-count":0,"title":["Addressing the cold-start problem with a two-branch architecture for fair tweet recommendation"],"prefix":"10.1145","author":[{"given":"Pere","family":"Gilabert","sequence":"first","affiliation":[{"name":"Universitat de Barcelona, Spain"}]},{"given":"Santi","family":"Segu\u00ed","sequence":"additional","affiliation":[{"name":"Universitat de Barcelona, Spain"}]}],"member":"320","published-online":{"date-parts":[[2021,11,22]]},"reference":[{"volume-title":"RecSys 2021 Challenge Workshop: Fairness-aware engagement prediction at scale on Twitter\u2019s Home Timeline. In RecSys \u201921: Fifteenth ACM Conference on Recommender Systems","year":"2021","author":"Anelli Vito\u00a0Walter","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","unstructured":"Luca Belli Sofia\u00a0Ira Ktena Alykhan Tejani Alexandre Lung-Yut-Fon Frank Portman Xiao Zhu Yuanpu Xie Akshay Gupta Michael Bronstein Amra Deli\u0107 Gabriele Sottocornola Walter Anelli Nazareno Andrade Jessie Smith and Wenzhe Shi. 2020. Privacy-Preserving Recommender Systems Challenge on Twitter\u2019s Home Timeline. (2020). arxiv:2004.13715\u00a0[cs.SI]  Luca Belli Sofia\u00a0Ira Ktena Alykhan Tejani Alexandre Lung-Yut-Fon Frank Portman Xiao Zhu Yuanpu Xie Akshay Gupta Michael Bronstein Amra Deli\u0107 Gabriele Sottocornola Walter Anelli Nazareno Andrade Jessie Smith and Wenzhe Shi. 2020. Privacy-Preserving Recommender Systems Challenge on Twitter\u2019s Home Timeline. (2020). arxiv:2004.13715\u00a0[cs.SI]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Luca Belli Alykhan Tejani Frank Portman Alexandre Lung-Yut-Fong Ben Chamberlain Yuanpu Xie Kristian Lum Jonathan Hunt Michael Bronstein Vito\u00a0Walter Anelli Saikishore Kalloori Bruce Ferwerda and Wenzhe Shi. 2021. The 2021 RecSys Challenge Dataset: Fairness is not optional. arxiv:2109.08245\u00a0[cs.SI]  Luca Belli Alykhan Tejani Frank Portman Alexandre Lung-Yut-Fong Ben Chamberlain Yuanpu Xie Kristian Lum Jonathan Hunt Michael Bronstein Vito\u00a0Walter Anelli Saikishore Kalloori Bruce Ferwerda and Wenzhe Shi. 2021. The 2021 RecSys Challenge Dataset: Fairness is not optional. arxiv:2109.08245\u00a0[cs.SI]","DOI":"10.1145\/3487572.3487573"},{"volume-title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. arxiv:1810.04805\u00a0[cs.CL]","year":"2018","author":"Devlin Jacob","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","unstructured":"Peter Flach and Meelis Kull. 2015. Precision-recall-gain curves: PR analysis done right. In Advances in neural information processing systems. 838\u2013846.  Peter Flach and Meelis Kull. 2015. Precision-recall-gain curves: PR analysis done right. In Advances in neural information processing systems. 838\u2013846."},{"key":"e_1_3_2_1_6_1","first-page":"24","volume":"202","author":"Gilabert Pere","journal-title":"Recommender Systems Challenge"},{"volume-title":"Proceedings of the Recommender Systems Challenge","year":"2020","author":"Goda Shuhei","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","unstructured":"Guolin Ke Qi Meng Thomas Finley Taifeng Wang Wei Chen Weidong Ma Qiwei Ye and Tie-Yan Liu. 2017. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. (2017) 3146\u20133154. http:\/\/papers.nips.cc\/paper\/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf  Guolin Ke Qi Meng Thomas Finley Taifeng Wang Wei Chen Weidong Ma Qiwei Ye and Tie-Yan Liu. 2017. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. (2017) 3146\u20133154. http:\/\/papers.nips.cc\/paper\/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf"},{"volume-title":"Proceedings of the Recommender Systems Challenge","year":"2020","author":"Schifferer Benedikt","key":"e_1_3_2_1_9_1"},{"volume-title":"Proceedings of the Recommender Systems Challenge","year":"2020","author":"Volkovs Maksims","key":"e_1_3_2_1_10_1"}],"event":{"name":"RecSysChallenge 2021: Proceedings of the Recommender Systems Challenge 2021","acronym":"RecSysChallenge 2021","location":"Amsterdam Netherlands"},"container-title":["RecSysChallenge '21: Proceedings of the Recommender Systems Challenge 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487572.3487598","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487572.3487598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:21Z","timestamp":1750188681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487572.3487598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":10,"alternative-id":["10.1145\/3487572.3487598","10.1145\/3487572"],"URL":"https:\/\/doi.org\/10.1145\/3487572.3487598","relation":{},"subject":[],"published":{"date-parts":[[2021,10]]}}}