article · 2012
Boundary-expanding locality sensitive hashing
Qiang Wang, Zhiyuan Guo, Gang Liu, Jun Guo
Cited by 4Abstract and details only
Abstract
Locality sensitive hashing (LSH) has been introduced as an indexing structure for fast large-scale data retrieval. A significant drawback of this technique is that a large number of hash functions require lots of hash computation time. To resolve this issue, the paper presents a new index construction algorithm called boundary-expanding LSH, where the boundary of each bucket is expanded so that each point may be mapped to multiple adjacent buckets in each hash table. The proposed algorithm can map points near to the two sides of the boundary into the same bucket, which increases the collision probability of neighbors. To achieve the same search accuracy, boundary-expanding LSH needs fewer hash tables and less hash computation time, so it can provide us a higher acceleration factor. To obtain the best performance, the paper also presents a parameter optimization method. Experiments conducted on two audio databases show its efficiency.
Cite this paper
Wang, Q., Guo, Z., Liu, G., & Guo, J. (2012). Boundary-expanding locality sensitive hashing. https://doi.org/10.1109/iscslp.2012.6423463
Wang, Qiang, et al. “Boundary-expanding locality sensitive hashing.” 2012, pp. 358–62, https://doi.org/10.1109/iscslp.2012.6423463.
Wang, Qiang, Zhiyuan Guo, Gang Liu, and Jun Guo. 2012. “Boundary-expanding locality sensitive hashing.” https://doi.org/10.1109/iscslp.2012.6423463.
Wang, Q. et al. (2012) ‘Boundary-expanding locality sensitive hashing’. Available at: https://doi.org/10.1109/iscslp.2012.6423463.
@article{wang2012boundary,
title = {{Boundary-expanding locality sensitive hashing}},
author = {Wang, Qiang and Guo, Zhiyuan and Liu, Gang and Guo, Jun},
pages = {358--362},
year = {2012},
doi = {10.1109/iscslp.2012.6423463}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.