基于组合码的内积相似搜索
Inner Product Similarity Search using Compositional Codes
摘要:
针对内积相似性下的最近邻搜索问题,提出了一种基于压缩码的方法。其思想是使用从源字典中选择的几个元素的组合来近似向量,并通过由所选元素的索引组成的短代码来表示该向量。从查询向量和数据库向量的短码有效地估计查询向量和数据库向量之间的内积。我们提出的组$M$选择算法,选择$M$元素从$M$源字典向量近似的搜索精度和效率方面的优良性能,通过理论和实证分析的紧凑代码。在大规模数据集($1M$和$1B$ SIFT特征、$1M$线性模型和Netflix)上的实验结果证明了该方法的优越性。
英文摘要:
This paper addresses the nearest neighbor search problem under inner product similarity and introduces a compact code-based approach. The idea is to approximate a vector using the composition of several elements selected from a source dictionary and to represent this vector by a short code composed of the indices of the selected elements. The inner product between a query vector and a database vector is efficiently estimated from the query vector and the short code of the database vector. We show the superior performance of the proposed group $M$-selection algorithm that selects $M$ elements from $M$ source dictionaries for vector approximation in terms of search accuracy and efficiency for compact codes of the same length via theoretical and empirical analysis. Experimental results on large-scale datasets ($1M$ and $1B$ SIFT features, $1M$ linear models and Netflix) demonstrate the superiority of the proposed approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。