|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
AdaLSH: Adaptive LSH for Solving c-Approximate Maximum Inner Product Search Problem
| Title: | AdaLSH: Adaptive LSH for Solving c-Approximate Maximum Inner Product Search Problem |
| Authors: | Lu, Kejing Browse this author | | Kudo, Mineichi Browse this author →KAKEN DB |
| Keywords: | image retrieval | | locality sensitive hashing | | maximum inner product search | | high-dimensional spaces |
| Issue Date: | Jan-2021 |
| Publisher: | 電子情報通信学会(The Institute of Electronics, Information and Communication Engineers / IEICE) |
| Journal Title: | IEICE transactions on information and systems |
| Volume: | E104D |
| Issue: | 1 |
| Start Page: | 138 |
| End Page: | 145 |
| Publisher DOI: | 10.1587/transinf.2020EDP7132 |
| Abstract: | Maximum inner product search (MIPS) problem has gained much attention in a wide range of applications. In order to overcome the curse of dimensionality in high-dimensional spaces, most of existing methods first transform the MIPS problem into another approximate nearest neighbor search (ANNS) problem and then solve it by Locality Sensitive Hashing (LSH). However, due to the error incurred by the transmission and incomprehensive search strategies, these methods suffer from low precision and have loose probability guarantees. In this paper, we propose a novel search method named Adaptive-LSH (AdaLSH) to solve MIPS problem more efficiently and more precisely. AdaLSH examines objects in the descending order of both norms and (the probably correctly estimated) cosine angles with a query object in support of LSH with extendable windows. Such extendable windows bring not only efficiency in searching but also the probability guarantee of finding exact or approximate MIP objects. AdaLSH gives a better probability guarantee of success than those in conventional algorithms, bringing less running times on various datasets compared with them. In addition, AdaLSH can even support exact MIPS with probability guarantee. |
| Rights: | Copyright ©2021 The Institute of Electronics, Information and Communication Engineers | | https://search.ieice.org/ |
| Type: | article |
| URI: | http://hdl.handle.net/2115/80413 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
|
