Partial Hash Update via Hamming Subspace Learning.

Abstract

Hashing technique has become an effective method for information retrieval due to the fast calculation of the Hamming distance. However, with the continuous growth of data coming from the Internet, the online update of hashing on the massive social data becomes very time-consuming. To alleviate this issue, in this paper, we propose a novel updating technique for hashing methods, namely Hamming Subspace Learning (HSL). The motivation of HSL is to generate a low-dimensional Hamming subspace from a high-dimensional Hamming space by selecting representative hash functions. Through HSL, we aim to improve the speed of updating binary codes for all samples. We present a method for Hamming subspace learning based on greedy selection strategy and the Distribution Preserving Hamming Subspace learning (DHSL) algorithm by designing a novel loss function. The experimental results demonstrate that the HSL is effective to improve the speed of online updating and the performance of hashing algorithm.