{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:24:14Z","timestamp":1648823054189},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1587\/transinf.2020edp7132","type":"journal-article","created":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T22:27:53Z","timestamp":1609453673000},"page":"138-145","source":"Crossref","is-referenced-by-count":0,"title":["AdaLSH: Adaptive LSH for Solving <i>c<\/i>-Approximate Maximum Inner Product Search Problem"],"prefix":"10.1587","volume":"E104.D","author":[{"given":"Kejing","family":"LU","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"KUDO","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] N. Koenigstein, P. Ram, and Y. Shavitt, \u201cEfficient retrieval of recommendations in a matrix factorization framework,\u201d Proc. 21st ACM International Conference on Information and Knowledge Management, Maui, HI, USA, pp.535-544, ACM, Oct. 2012. 10.1145\/2396761.2396831","DOI":"10.1145\/2396761.2396831"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] T. Dean, M.A. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik, \u201cFast, accurate detection of 100,000 object classes on a single machine,\u201d Proc. IEEE Conference on Computer Vision and Pattern Recognition, Portland, OR, USA, pp.1814-1821, IEEE, June 2013. 10.1109\/cvpr.2013.237","DOI":"10.1109\/CVPR.2013.237"},{"key":"3","unstructured":"[3] S. Riedel, L. Yao, B.M. Marlin, and A. McCallum, \u201cRelation extraction with matrix factorization and universal schemas,\u201d Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Atlanta, Georgia, USA, pp.74-84, The Association for Computational Linguistics, June 2013."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] R. Spring and A. Shrivastava, \u201cScalable and sustainable deep learning via randomized hashing,\u201d Proc. 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, pp.445-454, ACM, Aug. 2017. 10.1145\/3097983.3098035","DOI":"10.1145\/3097983.3098035"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] T. Joachims, T. Finley, and C.-N.J. Yu, \u201cCutting-plane training of structural SVMs,\u201d Machine Learning, vol.77, no.1, pp.27-59, Oct.-Dec. 2009. 10.1007\/s10994-009-5108-8","DOI":"10.1007\/s10994-009-5108-8"},{"key":"6","unstructured":"[6] A. Shrivastava and P. Li, \u201cImproved asymmetric locality sensitive hashing (alsh) for maximum inner product search (mips),\u201d Proc. Thirty-First Conference on Uncertainty in Artificial Intelligence, Amsterdam, The Netherlands, pp.812-821, AUAI Press, July 2015."},{"key":"7","unstructured":"[7] B. Neyshabur and N. Srebro, \u201cOn symmetric and asymmetric lshs for inner product search,\u201d Proc. 32nd International Conference on Machine Learning, Lille, France, pp.192-1934, July 2015."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Q. Huang, G. Ma, J. Feng, Q. Fang, and A.K.H. Tung, \u201cAccurate and fast asymmetric locality-sensitive hashing scheme for maximum inner product search,\u201d Proc. 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, London, UK, pp.1561-1570, ACM, Aug. 2018. 10.1145\/3219819.3219971","DOI":"10.1145\/3219819.3219971"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] P. Ram and A.G. Gray, \u201cMaximum inner-product search using cone trees,\u201dProc. 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China, pp.931-939, ACM, Aug. 2012. 10.1145\/2339530.2339677","DOI":"10.1145\/2339530.2339677"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] R.R. Curtin, P. Ram, and A.G. Gray, \u201cFast exact max-kernel search,\u201d Statistical Analysis and Data Mining, vol.7, no.1, pp.1-9, Feb.-Dec. 2014.","DOI":"10.1002\/sam.11218"},{"key":"11","unstructured":"[11] A. Shrivastava and P. Li, \u201cAsymmetric lsh (alsh) for sublinear time maximum inner product search (mips),\u201d Annual Conference on Neural Information Processing Systems, Montreal, Quebec, Canada, pp.2321-2329, Dec. 2014."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Y. Bachrach, Y. Finkelstein, R. Gilad-Bachrach, L. Katzir, N. Koenigstein, N. Nice, and U. Paquet, \u201cSpeeding up the xbox recommender system using a euclidean transformation for inner-product spaces,\u201d Proc. 8th ACM Conference on Recommender Systems, Foster City, Silicon Valley, CA, USA, pp.257-264, ACM, Oct. 2014. 10.1145\/2645710.2645741","DOI":"10.1145\/2645710.2645741"},{"key":"13","unstructured":"[13] Z. Zhou, S. Tan, Z. Xu, and P. Li, \u201cMobius transformation for fast inner product search on graph,\u201d NeurIPS, Vancouver, BC, Canada, pp.8216-8227, 2019."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] J. Liu, X. Yan, X. Dai, Z. Li, J. Cheng, and M.-C. Yang, \u201cUnderstanding and improving proximity graph based maximum inner product search,\u201d AAAI, New York, NY, USA, vol.34, no.1, pp.139-146, 2020. 10.1609\/aaai.v34i01.5344","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] X. Dai, X. Yan, K.K.W. Ng, J. Liu, and J. Cheng, \u201cNorm-explicit quantization: Improving vector quantization for maximum inner product search,\u201d AAAI, New York, NY, USA, vol.34, no.1, pp.51-58, 2020. 10.1609\/aaai.v34i01.5333","DOI":"10.1609\/aaai.v34i01.5333"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] H. Zhang, L. Cao, Y. Yan, S. Madden, and E.A. Rundensteiner, \u201cContinuously adaptive similarity search,\u201d Proc. 2020 ACM SIGMOD International Conference on Management of Data, Portland, OR, USA, pp.2601-2616, 2020. 10.1145\/3318464.3380601","DOI":"10.1145\/3318464.3380601"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] J. Gan, J. Feng, Q. Fang, and W. Ng, \u201cLocality-sensitive hashing scheme based on dynamic collision counting,\u201d Proc. ACM SIGMOD International Conference on Management of Data, Scottsdale, AZ, USA, pp.541-552, ACM, May 2012. 10.1145\/2213836.2213898","DOI":"10.1145\/2213836.2213898"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M. Datar, N. Immorlica, P. Indyk, and V.S. Mirrokni, \u201cLocality-sensitive hashing scheme based on p-stable distributions,\u201d Proc. Twentieth Annual Symposium on Computational Geometry-SCG '04, Brooklyn, New York, USA, pp.253-262, ACM, June 2004. 10.1145\/997817.997857","DOI":"10.1145\/997817.997857"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Q. Huang, J. Feng, Y. Zhang, Q. Fang, and W. Ng, \u201cQuery-aware locality-sensitive hashing for approximate nearest neighbor search,\u201d Proc. VLDB Endowment, Hawai'i, USA, vol.9, no.1, pp.1-12, Sept. 2015. 10.14778\/2850469.2850470","DOI":"10.14778\/2850469.2850470"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E104.D\/1\/E104.D_2020EDP7132\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T03:25:46Z","timestamp":1609557946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E104.D\/1\/E104.D_2020EDP7132\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2020edp7132","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}