To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
A Dynamic Locality Sensitive Hashing Algorithm for Efficient Security Applications |
|
Author |
Mohammad Y. Khanafseh, Ola M. Surakhi |
| Citation |
Vol. 24 No. 5 pp. 79-88 |
|
Abstract |
The information retrieval domain deals with the retrieval of unstructured data such as text documents. Searching documents is a main component of the modern information retrieval system. Locality Sensitive Hashing (LSH) is one of the most popular methods used in searching for documents in a high-dimensional space. The main benefit of LSH is its theoretical guarantee of query accuracy in a multi-dimensional space. More enhancement can be achieved to LSH by adding a bit to its steps. In this paper, a new Dynamic Locality Sensitive Hashing (DLSH) algorithm is proposed as an improved version of the LSH algorithm, which relies on employing the hierarchal selection of LSH parameters (number of bands, number of shingles, and number of permutation lists) based on the similarity achieved by the algorithm to optimize searching accuracy and increasing its score. Using several tampered file structures, the technique was applied, and the performance is evaluated. In some circumstances, the accuracy of matching with DLSH exceeds 95% with the optimal parameter value selected for the number of bands, the number of shingles, and the number of permutations lists of the DLSH algorithm. The result makes DLSH algorithm suitable to be applied in many critical applications that depend on accurate searching such as forensics technology. |
|
Keywords |
High Dimensional Data, Hash Function, Information Retrieval, Locality Sensitive Hashing, Nearest Neighbors Search, Similarity |
|
URL |
