{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T12:06:54Z","timestamp":1775995614577,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T00:00:00Z","timestamp":1473206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-IDEX-0004-02"],"award-info":[{"award-number":["ANR-11-IDEX-0004-02"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,9,7]]},"DOI":"10.1145\/2959100.2959149","type":"proceedings-article","created":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T18:25:14Z","timestamp":1472754314000},"page":"15-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["A Coverage-Based Approach to Recommendation Diversity On Similarity Graph"],"prefix":"10.1145","author":[{"given":"Shameem A.","family":"Puthiya Parambath","sequence":"first","affiliation":[{"name":"Universite de technologie de Compiegne, Compiegne, France"}]},{"given":"Nicolas","family":"Usunier","sequence":"additional","affiliation":[{"name":"Facebook, Paris, France"}]},{"given":"Yves","family":"Grandvalet","sequence":"additional","affiliation":[{"name":"Universite de technologie de Compiegne, Compiegne, France"}]}],"member":"320","published-online":{"date-parts":[[2016,9,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_3_2_2_2_1","volume-title":"IJCAI","author":"Ashkan Azin","year":"2015","unstructured":"Azin Ashkan , Branislav Kveton , Shlomo Berkovsky , and Zheng Wen . Optimal greedy diversity for recommendation . In IJCAI , 2015 . Azin Ashkan, Branislav Kveton, Shlomo Berkovsky, and Zheng Wen. Optimal greedy diversity for recommendation. In IJCAI, 2015."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213580"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-011-9167-7"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864721"},{"key":"e_1_3_2_2_7_1","volume-title":"An algorithm for quadratic programming. Naval research logistics quarterly, 3 (1--2): 95--110","author":"Frank Marguerite","year":"1956","unstructured":"Marguerite Frank and Philip Wolfe . An algorithm for quadratic programming. Naval research logistics quarterly, 3 (1--2): 95--110 , 1956 . Marguerite Frank and Philip Wolfe. An algorithm for quadratic programming. Naval research logistics quarterly, 3 (1--2): 95--110, 1956."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_2_9_1","first-page":"1142","volume-title":"NIPS","author":"He Jingrui","year":"2012","unstructured":"Jingrui He , Hanghang Tong , Qiaozhu Mei , and Boleslaw Szymanski . Gender : A generic diversified ranking algorithm . In NIPS , pages 1142 -- 1150 , 2012 . Jingrui He, Hanghang Tong, Qiaozhu Mei, and Boleslaw Szymanski. Gender: A generic diversified ranking algorithm. In NIPS, pages 1142--1150, 2012."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507226"},{"key":"e_1_3_2_2_11_1","first-page":"510","volume-title":"ACL","author":"Lin Hui","year":"2011","unstructured":"Hui Lin and Jeff Bilmes . A class of submodular functions for document summarization . In ACL , pages 510 -- 520 , 2011 . Hui Lin and Jeff Bilmes. A class of submodular functions for document summarization. In ACL, pages 510--520, 2011."},{"key":"e_1_3_2_2_12_1","volume-title":"An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14 (1)","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser , Laurence A Wolsey , and Marshall L Fisher . An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14 (1) , 1978 . George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14 (1), 1978."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.110"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365982"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772780"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328964.1328965"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043957"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507207"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020573"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043955"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645743"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2700496"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076120"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454030"},{"key":"e_1_3_2_2_27_1","first-page":"97","volume-title":"HLT-NAACL","author":"Zhu Xiaojin","year":"2007","unstructured":"Xiaojin Zhu , Andrew B Goldberg , Jurgen Van Gael , and David Andrzejewski . Improving diversity in ranking using absorbing random walks . In HLT-NAACL , pages 97 -- 104 , 2007 . Xiaojin Zhu, Andrew B Goldberg, Jurgen Van Gael, and David Andrzejewski. Improving diversity in ranking using absorbing random walks. In HLT-NAACL, pages 97--104, 2007."}],"event":{"name":"RecSys '16: Tenth ACM Conference on Recommender Systems","location":"Boston Massachusetts USA","acronym":"RecSys '16","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 10th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2959100.2959149","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2959100.2959149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:31Z","timestamp":1750220611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2959100.2959149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,7]]},"references-count":27,"alternative-id":["10.1145\/2959100.2959149","10.1145\/2959100"],"URL":"https:\/\/doi.org\/10.1145\/2959100.2959149","relation":{},"subject":[],"published":{"date-parts":[[2016,9,7]]},"assertion":[{"value":"2016-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}