A survey on locality sensitive hashing algorithms and their applications
O Jafari, P Maurya, P Nagarkar, KM Islam… - ar** key characteristics. Current IS methods often struggle with capturing complex …
A prior-free weighting scheme for binary code ranking
Fast similarity search has been a research focus in recent years. Binary hashing, which
embeds high-dimensional data points into Hamming space, is a promising way to accelerate …
embeds high-dimensional data points into Hamming space, is a promising way to accelerate …
[HTML][HTML] An online malicious spam email detection system using resource allocating network with locality sensitive hashing
In this paper, we propose a new online system that can quickly detect malicious spam
emails and adapt to the changes in the email contents and the Uniform Resource Locator …
emails and adapt to the changes in the email contents and the Uniform Resource Locator …
Finding similar items using lsh and bloom filter
Similarity search of text documents can be reduced to Approximate nearest Neighbor
Search by converting text documents into sets by using Shingling. In the proposed scheme …
Search by converting text documents into sets by using Shingling. In the proposed scheme …
Multiplicative distance: a method to alleviate distance instability for high-dimensional data
Recently, it has been shown that under a broad set of conditions, the commonly used
distance functions will become unstable in high-dimensional data space; ie, the distance to …
distance functions will become unstable in high-dimensional data space; ie, the distance to …