{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:40:17Z","timestamp":1781908817916,"version":"3.54.5"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency (JST) PRESTO","doi-asserted-by":"publisher","award":["JPMJPR1931"],"award-info":[{"award-number":["JPMJPR1931"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science Grant-in-Aid for Scientific Research","doi-asserted-by":"publisher","award":["18H04095"],"award-info":[{"award-number":["18H04095"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003382","name":"JST CREST","doi-asserted-by":"publisher","award":["JPMJCR21F2"],"award-info":[{"award-number":["JPMJCR21F2"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3234072","type":"journal-article","created":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T18:33:03Z","timestamp":1672857183000},"page":"2586-2596","source":"Crossref","is-referenced-by-count":8,"title":["Categorical Diversity-Aware Inner Product Search"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3306-4652","authenticated-orcid":false,"given":"Kohei","family":"Hirata","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University, Osaka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8571-4931","authenticated-orcid":false,"given":"Daichi","family":"Amagata","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University, Osaka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1282-386X","authenticated-orcid":false,"given":"Sumio","family":"Fujita","sequence":"additional","affiliation":[{"name":"Yahoo Japan Corporation, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4807-3156","authenticated-orcid":false,"given":"Takahiro","family":"Hara","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University, Osaka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403345"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2933267.2933298"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474229"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380281"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645741"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052585"},{"issue":"1","key":"ref8","first-page":"2971","article-title":"LIBMF: A library for parallel matrix factorization in shared-memory systems","volume":"17","author":"Chin","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5333"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2699499"},{"key":"ref12","first-page":"335","article-title":"Efficient PrefDiv algorithms for effective top-k result diversification","volume-title":"Proc. EDBT","author":"Ge"},{"key":"ref13","first-page":"3887","article-title":"Accelerating large-scale inference with anisotropic vector quantization","volume-title":"Proc. ICML","author":"Guo"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3546779"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/OJCS.2022.3215206"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219971"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2926720"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396831"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536373"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109674"},{"key":"ref23","first-page":"4721","article-title":"Non-metric similarity graphs for maximum inner product search","volume-title":"Proc. NIPS","author":"Morozov"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/BigData52589.2021.9671858"},{"key":"ref25","first-page":"1926","article-title":"On symmetric and asymmetric LSHs for inner product search","volume-title":"Proc. ICML","author":"Neyshabur"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339677"},{"key":"ref27","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","volume-title":"Proc. NIPS","author":"Shrivastava"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00143"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467412"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2996452"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747647"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3316596"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/OJIES.2020.3012627"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767710"},{"key":"ref35","first-page":"2952","article-title":"Norm-ranging LSH for maximum inner product search","volume-title":"Proc. NIPS","author":"Yan"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20356"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449835"},{"key":"ref38","first-page":"8216","article-title":"M\u00f6bius transformation for fast inner product search on graph","volume-title":"Proc. NIPS","author":"Zhou"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609634"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10005298.pdf?arnumber=10005298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T02:51:04Z","timestamp":1707447064000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10005298\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3234072","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}