{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T15:15:05Z","timestamp":1767453305811,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1145\/3487572.3487599","type":"proceedings-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T15:27:46Z","timestamp":1637594866000},"page":"15-21","source":"Crossref","is-referenced-by-count":5,"title":["Synerise at RecSys 2021: Twitter user engagement prediction with a fast neural model"],"prefix":"10.1145","author":[{"given":"Michal","family":"Daniluk","sequence":"first","affiliation":[{"name":"Synerise, Poland and Warsaw University of Technology, Poland"}]},{"given":"Jacek","family":"Dabrowski","sequence":"additional","affiliation":[{"name":"Synerise, Poland"}]},{"given":"Barbara","family":"Rychalska","sequence":"additional","affiliation":[{"name":"Synerise, Poland and Warsaw University of Technology, Poland"}]},{"given":"Konrad","family":"Goluchowski","sequence":"additional","affiliation":[{"name":"Synerise, Poland"}]}],"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":"Salman Aslam. 2021. Twitter by the Numbers: Stats Demographics & Fun Facts.https:\/\/www.omnicoreagency.com\/twitter-statistics\/ Salman Aslam. 2021. Twitter by the Numbers: Stats Demographics & Fun Facts.https:\/\/www.omnicoreagency.com\/twitter-statistics\/"},{"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"},{"key":"e_1_3_2_1_4_1","unstructured":"Micha\u0142 Daniluk Jacek Dabrowski Barbara Rychalska and Konrad Go\u0142uchowski. 2021. Synerise at KDD Cup 2021: Node Classification in Massive Heterogeneous Graphs. KDD Cup OGB Challenge 2021(2021). https:\/\/ogb.stanford.edu\/paper\/kddcup2021\/mag240m_SyneriseAI.pdf Micha\u0142 Daniluk Jacek Dabrowski Barbara Rychalska and Konrad Go\u0142uchowski. 2021. Synerise at KDD Cup 2021: Node Classification in Massive Heterogeneous Graphs. KDD Cup OGB Challenge 2021(2021). https:\/\/ogb.stanford.edu\/paper\/kddcup2021\/mag240m_SyneriseAI.pdf"},{"volume-title":"Modeling Multi-Destination Trips with Sketch-Based Model. WebTour 2021 ACM WSDM Workshop on Web Tourism","year":"2021","author":"Daniluk Micha\u0142","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Jacek D\u0105browski Barbara Rychalska Micha\u0142 Daniluk Dominika Basaj Konrad Go\u0142uchowski Piotr Babel Andrzej Micha\u0142owski and Adam Jakubowski. 2021. An efficient manifold density estimator for all recommendation systems. https:\/\/arxiv.org\/abs\/2006.01894 Jacek D\u0105browski Barbara Rychalska Micha\u0142 Daniluk Dominika Basaj Konrad Go\u0142uchowski Piotr Babel Andrzej Micha\u0142owski and Adam Jakubowski. 2021. An efficient manifold density estimator for all recommendation systems. https:\/\/arxiv.org\/abs\/2006.01894","DOI":"10.1007\/978-3-030-92273-3_27"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3415959.3415994"},{"volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980(2014).","year":"2014","author":"Kingma P","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","unstructured":"Ilya Loshchilov and Frank Hutter. 2017. Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101(2017). Ilya Loshchilov and Frank Hutter. 2017. Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101(2017)."},{"key":"e_1_3_2_1_10_1","unstructured":"Barbara Rychalska and Jacek Dabrowski. 2020. Synerise at SIGIR Rakuten Data Challenge 2020: Efficient Manifold Density Estimator for Cross-Modal Retrieval. SIGIR eCom Challenge 2020(2020). https:\/\/sigir-ecom.github.io\/ecom20DCPapers\/SIGIR_eCom20_DC_paper_1.pdf Barbara Rychalska and Jacek Dabrowski. 2020. Synerise at SIGIR Rakuten Data Challenge 2020: Efficient Manifold Density Estimator for Cross-Modal Retrieval. SIGIR eCom Challenge 2020(2020). https:\/\/sigir-ecom.github.io\/ecom20DCPapers\/SIGIR_eCom20_DC_paper_1.pdf"},{"key":"e_1_3_2_1_11_1","unstructured":"Victor Sanh Lysandre Debut Julien Chaumond and Thomas Wolf. 2019. DistilBERT a distilled version of BERT: smaller faster cheaper and lighter. arXiv preprint arXiv:1910.01108(2019). Victor Sanh Lysandre Debut Julien Chaumond and Thomas Wolf. 2019. DistilBERT a distilled version of BERT: smaller faster cheaper and lighter. arXiv preprint arXiv:1910.01108(2019)."},{"key":"e_1_3_2_1_12_1","unstructured":"Victor Sanh Lysandre Debut Julien Chaumond and Thomas Wolf. 2019. DistilBERT a distilled version of BERT: smaller faster cheaper and lighter. CoRR abs\/1910.01108(2019). arxiv:1910.01108http:\/\/arxiv.org\/abs\/1910.01108 Victor Sanh Lysandre Debut Julien Chaumond and Thomas Wolf. 2019. DistilBERT a distilled version of BERT: smaller faster cheaper and lighter. CoRR abs\/1910.01108(2019). arxiv:1910.01108http:\/\/arxiv.org\/abs\/1910.01108"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3415959.3415996"},{"volume-title":"From Louvain to","year":"2019","author":"Traag A.","key":"e_1_3_2_1_14_1"},{"volume-title":"Proceedings of the Recommender Systems Challenge","year":"2020","author":"Volkovs Maksims","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"}],"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.3487599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487572.3487599","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.3487599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":16,"alternative-id":["10.1145\/3487572.3487599","10.1145\/3487572"],"URL":"https:\/\/doi.org\/10.1145\/3487572.3487599","relation":{},"subject":[],"published":{"date-parts":[[2021,10]]}}}