{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:58:34Z","timestamp":1781045914611,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819572502","type":"print"},{"value":"9789819572519","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7251-9_24","type":"book-chapter","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:22:12Z","timestamp":1781043732000},"page":"356-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Backbone-Based Neighbor Transferring Proximity Graph for\u00a0Fast Inner Product Retrieval"],"prefix":"10.1007","author":[{"given":"Aoran","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuchen","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengzhe","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yihong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takahiro","family":"Hara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abuzaid, F., Sethi, G., Bailis, P., Zaharia, M.: To index or not to index: Optimizing exact maximum inner product search. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1250\u20131261. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00114"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Dai, X., Yan, X., Ng, K.K., Liu, J., Cheng, J.: Norm-explicit quantization: Improving vector quantization for maximum inner product search. In: Proceedings of the AAAI Conference on Artificial Intelligence (2020)","DOI":"10.1609\/aaai.v34i01.5333"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th international Conference on World Wide Web (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Fu, C., Wang, C., Cai, D.: High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility. IEEE Trans. Pattern Anal. Mach. Intell. (2021)","DOI":"10.1109\/TPAMI.2021.3067706"},{"key":"24_CR5","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. arXiv:1707.00143"},{"key":"24_CR6","unstructured":"Guo, R., et al.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning, pp. 3887\u20133896. PMLR (2020)"},{"key":"24_CR7","unstructured":"Hae-Chan, N., Taeho, K.: Product quantizer aware inverted index for scalable nearest neighbor search. In: CVF International Conference on Computer Vision, ICCV (2021)"},{"key":"24_CR8","unstructured":"He, X., Liao, L., Zhang, H., Nie, L., Hu, X., Chua, T.S.: Neural collaborative filtering. WWW \u201917, International World Wide Web Conferences Steering Committee"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/OJCS.2022.3215206","volume":"3","author":"K Hirata","year":"2022","unstructured":"Hirata, K., Amagata, D., Hara, T.: Cardinality estimation in inner product space. IEEE Open J. Comput. Soc. 3, 208\u2013216 (2022)","journal-title":"IEEE Open J. Comput. Soc."},{"key":"24_CR10","unstructured":"Jayaram\u00a0Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: Fast accurate billion-point nearest neighbor search on a single node. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","volume":"7","author":"J Johnson","year":"2019","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with gpus. IEEE Trans. Big Data 7(3), 535\u2013547 (2019)","journal-title":"IEEE Trans. Big Data"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Li, H., Chan, T.N., Yiu, M.L., Mamoulis, N.: Fexipro: fast and exact inner product retrieval in recommender systems. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 835\u2013850 (2017)","DOI":"10.1145\/3035918.3064009"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Liu, J., Yan, X., Dai, X., Li, Z., Cheng, J., Yang, M.C.: Understanding and improving proximity graph based maximum inner product search. In: Proceedings of the AAAI Conference on Artificial Intelligence (2020)","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J., Zhang, Y.: Reconsidering tree based methods for k-maximum inner-product search: The lrus-covertree. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00355"},{"key":"24_CR15","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. (2018)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Malkov, Y., Ponomarenko, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. (2014)","DOI":"10.1016\/j.is.2013.10.006"},{"key":"24_CR17","unstructured":"Morozov, S., Babenko, A.: Non-metric similarity graphs for maximum inner product search. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"24_CR18","unstructured":"Ni, Y., et al.: A content-driven micro-video recommendation dataset at scale. arXiv preprint arXiv:2309.15379 (2023)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Ootomo, H., Naruse, A., Nolet, C., Wang, R., Feher, T., Wang, Y.: Cagra: highly parallel graph construction and approximate nearest neighbor search for gpus. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE)","DOI":"10.1109\/ICDE60146.2024.00323"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Orenshtein, T., Shinkar, I.: Greedy random walk. Comb. Probab. Comput. (2014)","DOI":"10.1017\/S0963548313000552"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Paulev\u00e9, L., J\u00e9gou, H., Amsaleg, L.: Locality sensitive hashing: A comparison of hash function types and querying mechanisms. Pattern Recogn. Lett. (2010)","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"24_CR22","unstructured":"Sun, P., Simcha, D., Dopson, D., Guo, R., Kumar, S.: Soar: Improved indexing for approximate nearest neighbor search. In: Neural Information Processing Systems (2023)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Tan, S., Xu, Z., Zhao, W., Fei, H., Zhou, Z., Li, P.: Norm adjusted proximity graph for fast inner product retrieval. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 1552\u20131560 (2021)","DOI":"10.1145\/3447548.3467412"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Tan, S., Zhou, Z., Xu, Z., Li, P.: On efficient retrieval of top similarity vectors. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) (2019)","DOI":"10.18653\/v1\/D19-1527"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Teflioudi, C., Gemulla, R., Mykytiuk, O.: Lemp: Fast retrieval of large entries in a matrix product. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (2015)","DOI":"10.1145\/2723372.2747647"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Tian, Y., Zhao, X., Zhou, X.: DB-LSH: locality-sensitive hashing with query-based dynamic bucketing. In: ICDE, pp. 2250\u20132262 (2022)","DOI":"10.1109\/ICDE53745.2022.00214"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Tian, Y., Zhao, X., Zhou, X.: Db-lsh2.0: locality-sensitive hashing with query-based dynamic bucketing. IEEE Trans. Knowl. Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3295831"},{"key":"24_CR28","unstructured":"Tiwari, M., et al.: In: Proceedings of the 41st International Conference on Machine Learning. ICML\u201924"},{"key":"24_CR29","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P.: Graph attention networks. In: International Conference on Learning Representations (2018)"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Cao, Y., Liu, M., Chua, T.S.: Kgat: knowledge graph attention network for recommendation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. KDD \u201919, Association for Computing Machinery (2019)","DOI":"10.1145\/3292500.3330989"},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Xu, J., He, X., Li, H.: Deep learning for matching in search and recommendation. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, pp. 1365\u20131368 (2018)","DOI":"10.1145\/3209978.3210181"},{"key":"24_CR32","unstructured":"Yan, X., Li, J., Dai, X., Chen, H., Cheng, J.: Norm-ranging lsh for maximum inner product search. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"24_CR33","unstructured":"Yuan, G., et al.: Tenrec: A large-scale multipurpose benchmark dataset for recommender systems. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022)"},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, H., et al.: Cafe: Towards compact, adaptive, and fast embedding for large-scale recommendation models. Proc. ACM Manage. Data (2024)","DOI":"10.1145\/3639306"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Zhao, X., Chen, Z., Huang, K., Zhang, R., Zheng, B., Zhou, X.: Efficient approximate maximum inner product search over sparse vectors. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE) (2024)","DOI":"10.1109\/ICDE60146.2024.00303"},{"key":"24_CR36","doi-asserted-by":"crossref","unstructured":"Zhao, X., et al.: FARGO: fast maximum inner product search via global multi-probing. PVLDB (2023)","DOI":"10.14778\/3579075.3579084"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7251-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:22:18Z","timestamp":1781043738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7251-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819572502","9789819572519"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7251-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2025.ficloud.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}