master v1.0.5
Vitali Fedulov 2024-02-07 21:02:09 +01:00
parent bd63fbbcd4
commit 8330dfbe44
1 changed files with 1 additions and 1 deletions

View File

@ -9,6 +9,6 @@ Each vestor is discretized into a set of hashes, as described [here](https://vit
1) Provided a float vector []float64, use `CubeSet` and `CentralCube` functions to generate hypercube coordinates []int. The difference between the two functions is that one corresponds to hash-table record and the other to a query or vice versa, depending on performance/memory preference.
2) `HashSet` and `DecimalHash`/`FNV1aHash` are used to get corresponding hash set and central hash from the hypercube coordinates above. There are 2 alternative hash functions: DecimalHash and FNV1aHash. DecimalHash does not have collisions, but is not suitable for cases with large number of buckets or dimensions. FNV1aHash is applicable for all cases.
[Example](https://github.com/vitali-fedulov/imagehash/blob/master/hashes.go) for similar image search/clustering.
[Example](https://github.com/vitali-fedulov/imagehash/blob/master/hashes.go) for similar image search and clustering.
[Go doc](https://pkg.go.dev/github.com/vitali-fedulov/hyper) for full code documentation.