arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0339cs.LG
收藏

使用列生成学习哈希函数

Learning Hash Functions Using Column Generation

Australian Centre for Visual Technologies(澳大利亚视觉技术中心);School of Computer Science, The University of Adelaide(阿德莱德大学计算机科学学院)

Xi Li, Guosheng Lin, Chunhua Shen, Anton van den Hengel, Anthony Dick

摘要:

快速最近邻搜索在解决许多大规模问题中正成为越来越重要的工具。最近,已经开发了许多学习数据相关哈希函数的方法。在这项工作中,我们提出了一个列生成为基础的方法学习数据依赖的哈希函数的基础上的接近比较信息。给定一组编码成对接近度比较信息的三元组,我们的方法学习哈希函数,这些哈希函数在数据中保留相对比较关系,并在大幅度学习框架内尽可能保留相对比较关系。学习过程使用列生成来实现,因此被命名为CGHash。在列生成过程的每次迭代中,选择最佳散列函数。与大多数其他散列方法不同,我们的方法自然地推广到新的数据点;并且具有凸的训练目标,从而确保可以识别全局最优值。实验表明,该方法学习紧凑的二进制代码,其检索性能与国家的最先进的方法进行测试时,在几个基准数据集。

英文摘要:

Fast nearest neighbor searching is becoming an increasingly important tool in solving many large-scale problems. Recently a number of approaches to learning data-dependent hash functions have been developed. In this work, we propose a column generation based method for learning data-dependent hash functions on the basis of proximity comparison information. Given a set of triplets that encode the pairwise proximity comparison information, our method learns hash functions that preserve the relative comparison relationships in the data as well as possible within the large-margin learning framework. The learning procedure is implemented using column generation and hence is named CGHash. At each iteration of the column generation procedure, the best hash function is selected. Unlike most other hashing methods, our method generalizes to new data points naturally; and has a training objective which is convex, thus ensuring that the global optimum can be identified. Experiments demonstrate that the proposed method learns compact binary codes and that its retrieval performance compares favorably with state-of-the-art methods when tested on a few benchmark datasets.

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

↑