{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:51:04Z","timestamp":1757314264479,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T00:00:00Z","timestamp":1538438400000},"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":[],"published-print":{"date-parts":[[2018,10,2]]},"DOI":"10.1145\/3267471.3267486","type":"proceedings-article","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T12:21:55Z","timestamp":1538655715000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Similarity Based Methods For The Playlist Continuation Task"],"prefix":"10.1145","author":[{"given":"Guglielmo","family":"Faggioli","sequence":"first","affiliation":[{"name":"University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirko","family":"Polato","sequence":"additional","affiliation":[{"name":"University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Aiolli","sequence":"additional","affiliation":[{"name":"University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507189"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2652481"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240342"},{"key":"e_1_3_2_1_4_1","first-page":"11","volume-title":"Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN)","author":"Polato M.","year":"2016","unstructured":"M. Polato and F. Aiolli . Kernel based collaborative filtering for very large scale top-n item recommendation . In Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN) , pages 11 -- 16 , 2016 . M. Polato and F. Aiolli. Kernel based collaborative filtering for very large scale top-n item recommendation. In Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN), pages 11--16, 2016."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M. Polato and F. Aiolli. Exploiting sparsity to build efficient kernel based collaborative filtering for top-n item recommendation. 2017 forthcoming.  M. Polato and F. Aiolli. Exploiting sparsity to build efficient kernel based collaborative filtering for top-n item recommendation. 2017 forthcoming.","DOI":"10.1016\/j.neucom.2016.12.090"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.01.057"},{"key":"e_1_3_2_1_7_1","volume-title":"A novel boolean kernels family for categorical data. Entropy, 20(6)","author":"Polato M.","year":"2018","unstructured":"M. Polato , I. Lauriola , and F. Aiolli . A novel boolean kernels family for categorical data. Entropy, 20(6) , 2018 . M. Polato, I. Lauriola, and F. Aiolli. A novel boolean kernels family for categorical data. Entropy, 20(6), 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"Current challenges and visions in music recommender systems research. CoRR, abs\/1710.03208","author":"Schedl M.","year":"2017","unstructured":"M. Schedl , H. Zamani , C. Chen , Y. Deldjoo , and M. Elahi . Current challenges and visions in music recommender systems research. CoRR, abs\/1710.03208 , 2017 . M. Schedl, H. Zamani, C. Chen, Y. Deldjoo, and M. Elahi. Current challenges and visions in music recommender systems research. CoRR, abs\/1710.03208, 2017."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167280"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125486.3125494"}],"event":{"name":"RecSys Challenge '18: Proceedings of the ACM Recommender Systems Challenge 2018","acronym":"RecSys Challenge '18","location":"Vancouver BC Canada"},"container-title":["Proceedings of the ACM Recommender Systems Challenge 2018"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267471.3267486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3267471.3267486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:44Z","timestamp":1750208264000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267471.3267486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,2]]},"references-count":10,"alternative-id":["10.1145\/3267471.3267486","10.1145\/3267471"],"URL":"https:\/\/doi.org\/10.1145\/3267471.3267486","relation":{},"subject":[],"published":{"date-parts":[[2018,10,2]]},"assertion":[{"value":"2018-10-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}