{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:28Z","timestamp":1775912968533,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ByteDance Inc.","award":["PJ20230512900080"],"award-info":[{"award-number":["PJ20230512900080"]}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"name":"AI Singapore Programme","award":["AISG2-TC-2021-002"],"award-info":[{"award-number":["AISG2-TC-2021-002"]}]},{"name":"National University of Singapore and ByteDance","award":["PJ20230512900080"],"award-info":[{"award-number":["PJ20230512900080"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tkde.2024.3408815","type":"journal-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T21:12:28Z","timestamp":1717535548000},"page":"6786-6800","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing the Number of Clusters for Billion-Scale Quantization-Based Nearest Neighbor Search"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9256-295X","authenticated-orcid":false,"given":"Yujian","family":"Fu","sequence":"first","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2622-4075","authenticated-orcid":false,"given":"Cheng","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance Inc., Beijing, China"}]},{"given":"Xiaohui","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance Inc., Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4281-2053","authenticated-orcid":false,"given":"Weng-Fai","family":"Wong","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8618-4581","authenticated-orcid":false,"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-015-0470-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204034"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276318"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066213"},{"key":"ref9","first-page":"5199","article-title":"SPANN: Highly-efficient billion-scale approximate nearest neighborhood search","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/s101211259"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2907086"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564729"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397243"},{"key":"ref16","first-page":"3887","article-title":"Accelerating large-scale inference with anisotropic vector quantization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46478-7_42"},{"key":"ref21","first-page":"13771","article-title":"Rand-NSG: Fast accurate billion-point nearest neighbor search on a single node","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Subramanya"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380600"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8621917"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.5220\/0001787803310340"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2625260"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2597834"},{"key":"ref34","first-page":"727","article-title":"X-means: Extending k-means with efficient estimation of the number of clusters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pelleg"},{"key":"ref35","first-page":"10672","article-title":"HM-ANN: Efficient billion-point nearest neighbor search on heterogeneous memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ren"},{"issue":"25","key":"ref36","first-page":"39","article-title":"A survey on nearest neighbor search methods","volume":"95","author":"Reza","year":"2014","journal-title":"Int. J. Comput. Appl."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0329-7"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424580"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2817526"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594527"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10709365\/10547412.pdf?arnumber=10547412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T06:15:28Z","timestamp":1728454528000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10547412\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":42,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3408815","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}