{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T03:35:29Z","timestamp":1789788929082,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T00:00:00Z","timestamp":1442361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hasler Foundation","award":["11072"],"award-info":[{"award-number":["11072"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,9,16]]},"DOI":"10.1145\/2792838.2800180","type":"proceedings-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T12:36:32Z","timestamp":1441715792000},"page":"163-170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Blockbusters and Wallflowers"],"prefix":"10.1145","author":[{"given":"Fabian","family":"Christoffel","sequence":"first","affiliation":[{"name":"University of Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bibek","family":"Paudel","sequence":"additional","affiliation":[{"name":"University of Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Newell","sequence":"additional","affiliation":[{"name":"British Broadcasting Corporation, London, Gt Britain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abraham","family":"Bernstein","sequence":"additional","affiliation":[{"name":"University of Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,9,16]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Maximizing Aggregate Recommendation Diversity: A Graph-Theoretic Approach. In Workshop on Novelty and Diversity in Recommender Systems, ACM RecSys","author":"Adomavicius G.","year":"2011","unstructured":"G. Adomavicius and Y. Kwon . Maximizing Aggregate Recommendation Diversity: A Graph-Theoretic Approach. In Workshop on Novelty and Diversity in Recommender Systems, ACM RecSys , 2011 . G. Adomavicius and Y. Kwon. Maximizing Aggregate Recommendation Diversity: A Graph-Theoretic Approach. In Workshop on Novelty and Diversity in Recommender Systems, ACM RecSys, 2011."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.15"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312230"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367618"},{"key":"e_1_3_2_2_5_1","volume-title":"Workshop on Context-Aware Recommender Systems, ACM RecSys","author":"Bogers T.","year":"2010","unstructured":"T. Bogers . Movie Recommendation using Random Walks over the Contextual Graph . In Workshop on Context-Aware Recommender Systems, ACM RecSys , 2010 . T. Bogers. Movie Recommendation using Random Walks over the Contextual Graph. In Workshop on Context-Aware Recommender Systems, ACM RecSys, 2010."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2579244"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2042182.2042197"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1080.0974"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.9"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043989"},{"key":"e_1_3_2_2_11_1","author":"Goldstein D. G.","year":"2006","unstructured":"D. G. Goldstein and D. C. Goldstein . Profiting from the long tail. Harvard Business Review , 2006 . D. G. Goldstein and D. C. Goldstein. Profiting from the long tail. Harvard Business Review, 2006.","journal-title":"Profiting from the long tail. Harvard Business Review"},{"key":"e_1_3_2_2_12_1","volume-title":"IJCAI","author":"Gori M.","year":"2007","unstructured":"M. Gori and A. Pucci . ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines . In IJCAI , 2007 . M. Gori and A. Pucci. ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines. In IJCAI, 2007."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963775"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398488"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125451.1125659"},{"key":"e_1_3_2_2_18_1","volume-title":"The Filter Bubble: What the Internet is Hiding from You","author":"Pariser E.","year":"2011","unstructured":"E. Pariser . The Filter Bubble: What the Internet is Hiding from You . Penguin UK , 2011 . E. Pariser. The Filter Bubble: What the Internet is Hiding from You. Penguin UK, 2011."},{"key":"e_1_3_2_2_19_1","volume-title":"UAI","author":"Rendle S.","year":"2009","unstructured":"S. Rendle , C. Freudenthaler , Z. Gantner , and L. Schmidt-Thieme . BPR: Bayesian Personalized Ranking from Implicit Feedback . In UAI , 2009 . S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI, 2009."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390269"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043955"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835896"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1000488107"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"}],"event":{"name":"RecSys '15: Ninth ACM Conference on Recommender Systems","location":"Vienna Austria","acronym":"RecSys '15","sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 9th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792838.2800180","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2792838.2800180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:33Z","timestamp":1750223253000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792838.2800180"}},"subtitle":["Accurate, Diverse, and Scalable Recommendations with Random Walks"],"short-title":[],"issued":{"date-parts":[[2015,9,16]]},"references-count":24,"alternative-id":["10.1145\/2792838.2800180","10.1145\/2792838"],"URL":"https:\/\/doi.org\/10.1145\/2792838.2800180","relation":{},"subject":[],"published":{"date-parts":[[2015,9,16]]},"assertion":[{"value":"2015-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}