{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:45:11Z","timestamp":1762253111196,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"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":[[2019,9,10]]},"DOI":"10.1145\/3298689.3347005","type":"proceedings-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T13:21:31Z","timestamp":1568208091000},"page":"472-476","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Pick &amp; merge"],"prefix":"10.1145","author":[{"given":"Adi","family":"Makmal","sequence":"first","affiliation":[{"name":"Microsoft R&amp;D, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Ephrath","sequence":"additional","affiliation":[{"name":"Microsoft R&amp;D, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilik","family":"Berezin","sequence":"additional","affiliation":[{"name":"Microsoft R&amp;D, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liron","family":"Allerhand","sequence":"additional","affiliation":[{"name":"Microsoft R&amp;D, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Nice","sequence":"additional","affiliation":[{"name":"Microsoft R&amp;D, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noam","family":"Koenigstein","sequence":"additional","affiliation":[{"name":"Microsoft R&amp;D, Israel and Tel-Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. KDD Cup and Workshop","author":"Bennett J.","year":"2007","unstructured":"J. Bennett and S. Lanning . The Netflix Prize . In Proc. KDD Cup and Workshop , 2007 . J. Bennett and S. Lanning. The Netflix Prize. In Proc. KDD Cup and Workshop, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/0022-3719\/20\/4\/001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883057"},{"key":"e_1_3_2_1_7_1","first-page":"291","volume-title":"Proceedings of the fifth international conference on computer and information technology","volume":"1","author":"Sarwar B. M.","year":"2002","unstructured":"B. M. Sarwar , G. Karypis , J. Konstan , and J. Riedl . Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering . In Proceedings of the fifth international conference on computer and information technology , volume 1 , pages 291 -- 324 , 2002 . B. M. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In Proceedings of the fifth international conference on computer and information technology, volume 1, pages 291--324, 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"}],"event":{"name":"RecSys '19: Thirteenth ACM Conference on Recommender Systems","acronym":"RecSys '19","location":"Copenhagen Denmark"},"container-title":["Proceedings of the 13th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3347005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3298689.3347005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:55Z","timestamp":1750201975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3347005"}},"subtitle":["an efficient item filtering scheme for Windows store recommendations"],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":8,"alternative-id":["10.1145\/3298689.3347005","10.1145\/3298689"],"URL":"https:\/\/doi.org\/10.1145\/3298689.3347005","relation":{},"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"2019-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}