{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:45:35Z","timestamp":1782992735134,"version":"3.54.5"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2022,8,1]]},"DOI":"10.1109\/tbdata.2021.3103263","type":"journal-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T20:02:40Z","timestamp":1628798560000},"page":"955-967","source":"Crossref","is-referenced-by-count":35,"title":["Improving Accuracy and Diversity in Matching of Recommendation With Diversified Preference Network"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3170-5647","authenticated-orcid":false,"given":"Ruobing","family":"Xie","sequence":"first","affiliation":[{"name":"WeChat Search Application Department, Tencent, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4953-1537","authenticated-orcid":false,"given":"Qi","family":"Liu","sequence":"additional","affiliation":[{"name":"WeChat Search Application Department, Tencent, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7369-2958","authenticated-orcid":false,"given":"Shukai","family":"Liu","sequence":"additional","affiliation":[{"name":"WeChat Search Application Department, Tencent, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-843X","authenticated-orcid":false,"given":"Ziwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2957-8511","authenticated-orcid":false,"given":"Peng","family":"Cui","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2942-1311","authenticated-orcid":false,"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[{"name":"WeChat Search Application Department, Tencent, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5471-500X","authenticated-orcid":false,"given":"Leyu","family":"Lin","sequence":"additional","affiliation":[{"name":"WeChat Search Application Department, Tencent, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219869"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219826"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/379"},{"key":"ref5","article-title":"Improving recommendation diversity","volume-title":"Proc. AICS","author":"Bradley"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.02.009"},{"key":"ref7","first-page":"5627","article-title":"Fast greedy MAP inference for determinantal point process to improve recommendation diversity","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1135-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24251\/HICSS.2019.159"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-013-0252-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159720"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939704"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30671-1_4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0151"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/349"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/435"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357925"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357895"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5768"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403314"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICALT.2008.198"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505665"},{"key":"ref31","article-title":"Joint optimization of tree-based index and deep model for recommender systems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref32","article-title":"Learning optimal tree models under beam search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhuo"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403305"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454030"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412732"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2700496"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401213"},{"key":"ref38","first-page":"2698","article-title":"Promoting diversity in recommendation by entropy regularizer","volume-title":"Proc. 23rd Int. Joint Conf. Artif. Intell.","author":"Qin"},{"key":"ref39","first-page":"97","article-title":"Improving diversity in ranking using absorbing random walks","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics","author":"Zhu"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3503181.3503203"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/537"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911548"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392748"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18178\/wcse.2019.06.016"},{"key":"ref45","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref46","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301346"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401198"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403323"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67667-4_1"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3416021"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref57","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411954"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16580"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450039"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.18653\/vl\/N19-142"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/9821020\/09512443.pdf?arnumber=9512443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:23:44Z","timestamp":1705015424000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9512443\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,1]]},"references-count":62,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2021.3103263","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,1]]}}}