Use of locality sensitive hashing (LSH) algorithm to match Web of Science and Scopus.
Mehmet Ali AbdulhayogluBart ThijsPublished in: Scientometrics (2018)
Keyphrases
- locality sensitive hashing
- brute force
- optimal solution
- kd tree
- search space
- approximate nearest neighbor search
- dynamic programming
- detection algorithm
- space efficient
- similarity measure
- approximate nearest neighbor
- nearest neighbor search
- hamming distance
- tree structure
- simulated annealing
- hash table
- nearest neighbor
- computational complexity
- databases
- locality sensitive