{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:40:24Z","timestamp":1781908824615,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,13]]},"DOI":"10.1145\/3460231.3474229","type":"proceedings-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T21:45:02Z","timestamp":1631569502000},"page":"273-281","source":"Crossref","is-referenced-by-count":12,"title":["Reverse Maximum Inner Product Search: How to efficiently find users who would like to buy my item?"],"prefix":"10.1145","author":[{"given":"Daichi","family":"Amagata","sequence":"first","affiliation":[{"name":"Osaka University, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takahiro","family":"Hara","sequence":"additional","affiliation":[{"name":"Osaka University, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Firas Abuzaid Geet Sethi Peter Bailis and Matei Zaharia. 2019. To Index or Not to Index: Optimizing Exact Maximum Inner Product Search. In ICDE. 1250\u20131261.  Firas Abuzaid Geet Sethi Peter Bailis and Matei Zaharia. 2019. To Index or Not to Index: Optimizing Exact Maximum Inner Product Search. In ICDE. 1250\u20131261.","DOI":"10.1109\/ICDE.2019.00114"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Daichi Amagata and Takahiro Hara. 2019. Identifying the Most Interactive Object in Spatial Databases. In ICDE. 1286\u20131297.  Daichi Amagata and Takahiro Hara. 2019. Identifying the Most Interactive Object in Spatial Databases. In ICDE. 1286\u20131297.","DOI":"10.1109\/ICDE.2019.00117"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Yoram Bachrach Yehuda Finkelstein Ran Gilad-Bachrach Liran Katzir Noam Koenigstein Nir Nice and Ulrich Paquet. 2014. Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces. In RecSys. 257\u2013264.  Yoram Bachrach Yehuda Finkelstein Ran Gilad-Bachrach Liran Katzir Noam Koenigstein Nir Nice and Ulrich Paquet. 2014. Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces. In RecSys. 257\u2013264.","DOI":"10.1145\/2645710.2645741"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Chong Chen Min Zhang Yongfeng Zhang Weizhi Ma Yiqun Liu and Shaoping Ma. 2020. Efficient Heterogeneous Collaborative Filtering without Negative Sampling for Recommendation. In AAAI. 19\u201326.  Chong Chen Min Zhang Yongfeng Zhang Weizhi Ma Yiqun Liu and Shaoping Ma. 2020. Efficient Heterogeneous Collaborative Filtering without Negative Sampling for Recommendation. In AAAI. 19\u201326.","DOI":"10.1609\/aaai.v34i01.5329"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.3007039"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0989"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Paolo Cremonesi Yehuda Koren and Roberto Turrin. 2010. Performance of recommender algorithms on top-n recommendation tasks. In RecSys. 39\u201346.  Paolo Cremonesi Yehuda Koren and Roberto Turrin. 2010. Performance of recommender algorithms on top-n recommendation tasks. In RecSys. 39\u201346.","DOI":"10.1145\/1864708.1864721"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Ryan\u00a0R Curtin Parikshit Ram and Alexander\u00a0G Gray. 2013. Fast exact max-kernel search. In SDM. 1\u20139.  Ryan\u00a0R Curtin Parikshit Ram and Alexander\u00a0G Gray. 2013. Fast exact max-kernel search. In SDM. 1\u20139.","DOI":"10.1137\/1.9781611972832.1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Xinyan Dai Xiao Yan Kelvin\u00a0KW Ng Jiu Liu and James Cheng. 2020. Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search. In AAAI. 51\u201358.  Xinyan Dai Xiao Yan Kelvin\u00a0KW Ng Jiu Liu and James Cheng. 2020. Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search. In AAAI. 51\u201358.","DOI":"10.1609\/aaai.v34i01.5333"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Shuai Ding and Torsten Suel. 2011. Faster top-k document retrieval using block-max indexes. In SIGIR. 993\u20131002.  Shuai Ding and Torsten Suel. 2011. Faster top-k document retrieval using block-max indexes. In SIGIR. 993\u20131002.","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402756"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Marco Fraccaro Ulrich Paquet and Ole Winther. 2016. Indexable probabilistic matrix factorization for maximum inner product search. In AAAI. 1554\u20131560.  Marco Fraccaro Ulrich Paquet and Ole Winther. 2016. Indexable probabilistic matrix factorization for maximum inner product search. In AAAI. 1554\u20131560.","DOI":"10.1609\/aaai.v30i1.10234"},{"key":"e_1_3_2_2_13_1","unstructured":"Ruiqi Guo Philip Sun Erik Lindgren Quan Geng David Simcha Felix Chern and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In ICML. 3887\u20133896.  Ruiqi Guo Philip Sun Erik Lindgren Quan Geng David Simcha Felix Chern and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In ICML. 3887\u20133896."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Qiang Huang Guihong Ma Jianlin Feng Qiong Fang and Anthony\u00a0KH Tung. 2018. Accurate and fast asymmetric locality-sensitive hashing scheme for maximum inner product search. In KDD. 1561\u20131570.  Qiang Huang Guihong Ma Jianlin Feng Qiong Fang and Anthony\u00a0KH Tung. 2018. Accurate and fast asymmetric locality-sensitive hashing scheme for maximum inner product search. In KDD. 1561\u20131570.","DOI":"10.1145\/3219819.3219971"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380283"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Noam Koenigstein Parikshit Ram and Yuval Shavitt. 2012. Efficient retrieval of recommendations in a matrix factorization framework. In CIKM. 535\u2013544.  Noam Koenigstein Parikshit Ram and Yuval Shavitt. 2012. Efficient retrieval of recommendations in a matrix factorization framework. In CIKM. 535\u2013544.","DOI":"10.1145\/2396761.2396831"},{"key":"e_1_3_2_2_17_1","unstructured":"Richard\u00a0E Korf. 2009. Multi-Way Number Partitioning.. In IJCAI. 538\u2013543.  Richard\u00a0E Korf. 2009. Multi-Way Number Partitioning.. In IJCAI. 538\u2013543."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Hui Li Tsz\u00a0Nam Chan Man\u00a0Lung Yiu and Nikos Mamoulis. 2017. FEXIPRO: fast and exact inner product retrieval in recommender systems. In SIGMOD. 835\u2013850.  Hui Li Tsz\u00a0Nam Chan Man\u00a0Lung Yiu and Nikos Mamoulis. 2017. FEXIPRO: fast and exact inner product retrieval in recommender systems. In SIGMOD. 835\u2013850.","DOI":"10.1145\/3035918.3064009"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Jie Liu Xiao Yan Xinyan Dai Zhirong Li James Cheng and Ming-Chang Yang. 2020. Understanding and Improving Proximity Graph Based Maximum Inner Product Search. In AAAI. 139\u2013146.  Jie Liu Xiao Yan Xinyan Dai Zhirong Li James Cheng and Ming-Chang Yang. 2020. Understanding and Improving Proximity Graph Based Maximum Inner Product Search. In AAAI. 139\u2013146.","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Rui Liu Tianyi Wu and Barzan Mozafari. 2019. A Bandit Approach to Maximum Inner Product Search. In AAAI. 4376\u20134383.  Rui Liu Tianyi Wu and Barzan Mozafari. 2019. A Bandit Approach to Maximum Inner Product Search. In AAAI. 4376\u20134383.","DOI":"10.1609\/aaai.v33i01.33014376"},{"key":"e_1_3_2_2_22_1","unstructured":"Stanislav Morozov and Artem Babenko. 2018. Non-metric similarity graphs for maximum inner product search. In NeurIPS. 4721\u20134730.  Stanislav Morozov and Artem Babenko. 2018. Non-metric similarity graphs for maximum inner product search. In NeurIPS. 4721\u20134730."},{"key":"e_1_3_2_2_23_1","unstructured":"Behnam Neyshabur and Nathan Srebro. 2015. On Symmetric and Asymmetric LSHs for Inner Product Search. In ICML. 1926\u20131934.  Behnam Neyshabur and Nathan Srebro. 2015. On Symmetric and Asymmetric LSHs for Inner Product Search. In ICML. 1926\u20131934."},{"key":"e_1_3_2_2_24_1","unstructured":"Parikshit Ram and Alexander\u00a0G Gray. 2012. Maximum inner-product search using cone trees. In KDD. 931\u2013939.  Parikshit Ram and Alexander\u00a0G Gray. 2012. Maximum inner-product search using cone trees. In KDD. 931\u2013939."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Steffen Rendle Walid Krichene Li Zhang and John Anderson. 2020. Neural Collaborative Filtering vs. Matrix Factorization Revisited. In RecSys. 240\u2013248.  Steffen Rendle Walid Krichene Li Zhang and John Anderson. 2020. Neural Collaborative Filtering vs. Matrix Factorization Revisited. In RecSys. 240\u2013248.","DOI":"10.1145\/3383313.3412488"},{"key":"e_1_3_2_2_26_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). In NIPS. 2321\u20132329.  Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). In NIPS. 2321\u20132329."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996452"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747647"},{"key":"e_1_3_2_2_29_1","unstructured":"Aaron Van\u00a0den Oord Sander Dieleman and Benjamin Schrauwen. 2013. Deep content-based music recommendation. In NIPS. 2643\u20132651.  Aaron Van\u00a0den Oord Sander Dieleman and Benjamin Schrauwen. 2013. Deep content-based music recommendation. In NIPS. 2643\u20132651."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Akrivi Vlachou Christos Doulkeridis Yannis Kotidis and Kjetil N\u00f8rv\u00e5g. 2010. Reverse top-k queries. In ICDE. 365\u2013376.  Akrivi Vlachou Christos Doulkeridis Yannis Kotidis and Kjetil N\u00f8rv\u00e5g. 2010. Reverse top-k queries. In ICDE. 365\u2013376.","DOI":"10.1109\/ICDE.2010.5447890"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.50"},{"key":"e_1_3_2_2_32_1","unstructured":"Xiao Yan Jinfeng Li Xinyan Dai Hongzhi Chen and James Cheng. 2018. Norm-ranging lsh for maximum inner product search. In NeurIPS. 2952\u20132961.  Xiao Yan Jinfeng Li Xinyan Dai Hongzhi Chen and James Cheng. 2018. Norm-ranging lsh for maximum inner product search. In NeurIPS. 2952\u20132961."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735492"},{"key":"e_1_3_2_2_34_1","unstructured":"Hsiang-Fu Yu Cho-Jui Hsieh Qi Lei and Inderjit\u00a0S Dhillon. 2017. A greedy approach for budgeted maximum inner product search. In NIPS. 5453\u20135462.  Hsiang-Fu Yu Cho-Jui Hsieh Qi Lei and Inderjit\u00a0S Dhillon. 2017. A greedy approach for budgeted maximum inner product search. In NIPS. 5453\u20135462."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Hamed Zamani and W\u00a0Bruce Croft. 2020. Learning a Joint Search and Recommendation Model from User-Item Interactions. In WSDM. 717\u2013725.  Hamed Zamani and W\u00a0Bruce Croft. 2020. Learning a Joint Search and Recommendation Model from User-Item Interactions. In WSDM. 717\u2013725.","DOI":"10.1145\/3336191.3371818"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732952"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Xing Zhao Ziwei Zhu Yin Zhang and James Caverlee. 2020. Improving the Estimation of Tail Ratings in Recommender System with Multi-Latent Representations. In WSDM. 762\u2013770.  Xing Zhao Ziwei Zhu Yin Zhang and James Caverlee. 2020. Improving the Estimation of Tail Ratings in Recommender System with Multi-Latent Representations. In WSDM. 762\u2013770.","DOI":"10.1145\/3336191.3371810"},{"key":"e_1_3_2_2_38_1","unstructured":"Zhixin Zhou Shulong Tan Zhaozhuo Xu and Ping Li. 2019. M\u00f6bius Transformation for Fast Inner Product Search on Graph. In NeurIPS. 8216\u20138227.  Zhixin Zhou Shulong Tan Zhaozhuo Xu and Ping Li. 2019. M\u00f6bius Transformation for Fast Inner Product Search on Graph. In NeurIPS. 8216\u20138227."}],"event":{"name":"RecSys '21: Fifteenth ACM Conference on Recommender Systems","location":"Amsterdam Netherlands","acronym":"RecSys '21","sponsor":["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","SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Fifteenth ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460231.3474229","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460231.3474229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:17Z","timestamp":1750191137000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460231.3474229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":38,"alternative-id":["10.1145\/3460231.3474229","10.1145\/3460231"],"URL":"https:\/\/doi.org\/10.1145\/3460231.3474229","relation":{},"subject":[],"published":{"date-parts":[[2021,9,13]]}}}