Locality-Sensitive Hashing
Locality-sensitive hashing
(LSH) reduces the dimensionality of high-dimensional data and hashes input items so that similar items map to the same “buckets” with high probability (the number of buckets being much smaller than the universe of possible input items).
Install
$ npm install lsh --save
Usage
To figure out how to use this package please take a look at test files
const RandomWords = require('random-words')
const Lsh = require('@agtabesh/lsh')
const config = {
storage: 'memory',
shingleSize: 5,
numberOfHashFunctions: 120
}
const lsh = Lsh.getInstance(config)
const numberOfDocuments = 100
const documents = []
for (let i = 0; i < numberOfDocuments; i += 1) {
documents.push(RandomWords({ min: 100, max: 100 }).join(' '))
}
for (let i = 0; i < numberOfDocuments; i += 1) {
lsh.addDocument(i, documents[i])
}
const q = {
id: 1,
bucketSize: 6
}
const result = lsh.query(q)
console.log(result)
It's incredibly fast. No matter how many documents you have, time complexity is always constant. Its Dependencies are injected by using @adonisjs/fold which allows us to extend the package freely. There is only one storage and I'll be appreciated if you would implement the other storages such as Redis and submit a pull request.
In this package, MurmurHash, a non-cryptographic hash function which is faster than cryptographic hash function, is used.
Running tests
You can run the test suite using the following commands:
npm test
All contributions are welcome. Please ensure that the tests are passing when submitting a pull request. If you're adding new features to this package, please include tests.
Release History
0.1.0 - Initial release, basic functionality and supports memory storage.