java-LSH

java-LSH copied to clipboard

Examples show boolean vectors, what about string vectors?

4

Hi, I was wondering how to use this library for comparing two different Strings that are tokenized into a string vector each. The examples only show boolean vectors which are...

stenpiren

Bumps [junit](https://github.com/junit-team/junit4) from 4.10 to 4.13.1. Release notes Sourced from junit's releases. JUnit 4.13.1 Please refer to the release notes for details. JUnit 4.13 Please refer to the release notes...

dependabot[bot]

Use Bitset instead of Array<boolean>

1

The current implementation uses a `boolean[]` as an input. Use of a BitSet (https://docs.oracle.com/javase/7/docs/api/java/util/BitSet.html) would be a lot more efficient. For example, if dictionary size is `Integer.MAX_INT`, as it would...

rocketraman

I see that the algorithm is based on the MMDS book by Ullman et al. However, your implementation seems to use a fixed THRESHOLD value of 0.5, whereas in the...

rocketraman

Correct signature size calculation

3

According to the description in this file, signature size equals to R * b instead of R * s

snie2012

The hash signature method of LSH class is order independent. But according to Mining of Massive Datasets the bands should be identical. In the current implementation assume two bands of...

fuatbasik

Allow the hash function in LSHMinHash to take a set as input.

snie2012

In the comments of the example LSHMinHash code, it says that 'to get relevant results, the number of elements per bucket should be at least 100'. Why? I tried to...

snie2012

Hi, I don't know how to return the topk similar vectors. Should I use signatures to calculate similarity? Or to use hashvalue of signatures to calculate? Thanks very much,

Alisaincd

Dealing with missing data

2

I am contemplating using LSH in my application, but I am unsure how to deal with absent/missing data in a vector. The nearest neighbor imputation implies that this type of...

LarsOL