arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.03219stat.MLcs.LG

Sharing Hash Codes for Multiple Purposes

Technische Unversität Berlin(柏林工业大学);DFKI(德国人工智能研究中心);Fraunhofer HHI(弗劳恩霍夫海因里希赫兹研究所);IIT Hyderabad(海得拉巴印度理工学院);Korea University(高丽大学);Max Planck Society(马克斯·普朗克学会);Berlin Big Data Center(柏林大数据中心)

Wikor Pronobis, Danny Panknin, Johannes Kirschnick, Vignesh Srinivasan, Wojciech Samek, Volker Markl, Manohar Kaul, Klaus-Robert Mueller, Shinichi Nakajima

英文摘要:

Locality sensitive hashing (LSH) is a powerful tool for sublinear-time approximate nearest neighbor search, and a variety of hashing schemes have been proposed for different dissimilarity measures. However, hash codes significantly depend on the dissimilarity, which prohibits users from adjusting the dissimilarity at query time. In this paper, we propose {multiple purpose LSH (mp-LSH) which shares the hash codes for different dissimilarities. mp-LSH supports L2, cosine, and inner product dissimilarities, and their corresponding weighted sums, where the weights can be adjusted at query time. It also allows us to modify the importance of pre-defined groups of features. Thus, mp-LSH enables us, for example, to retrieve similar items to a query with the user preference taken into account, to find a similar material to a query with some properties (stability, utility, etc.) optimized, and to turn on or off a part of multi-modal information (brightness, color, audio, text, etc.) in image/video retrieval. We theoretically and empirically analyze the performance of three variants of mp-LSH, and demonstrate their usefulness on real-world data sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑