S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions

To compare the similarity of probability distributions, the information-theoretically motivated metrics like Kullback-Leibler divergence (KL) and Jensen-Shannon divergence (JSD) are often more reasonable compared with metrics for vectors like Euclidean and angular distance. However, existing locality-sensitive hashing (LSH) algorithms cannot support the information-theoretically motivated metrics for probability distributions. In this paper, we first introduce a new approximation formula for S2JSD-distance, and then propose a novel LSH scheme adapted to S2JSD-distance for approximate nearest neighbors search in high-dimensional probability distributions. We define the specific hashing functions, and prove their local-sensitivity. Furthermore, extensive empirical evaluations well illustrate the effectiveness of the proposed hashing schema on six public image datasets and two text datasets, in terms of mean Average Precision, Precision@N and Precision-Recall curve.

Authors

• Xian-Ling Mao Beijing Institute of Technology
• Bo-Si Feng
• Yi-Jing Hao
• Liqiang Nie Harbin Institute of Technology (Shenzhen)
• Heyan Huang Beijing Institute of Technology
• Guihua Wen

Keywords

No keywords are indexed for this paper.