Jianshu_Zhao
Jianshu_Zhao
Nobody is maintaining the repo right. I am wondering when this fix can be submitted to crates.io Thank, Jianshu
Hello Daniel, A follow up question, is the one permutation MinHash/SetSketch in Dashing2 the one used in BinDash (I noticed that you also contribute to it), which is the b-bit...
Hello Daniel, I found that bindash is much more accurate than Dashing fro small Jaccard like those around 0.01 or so. Please see the attached result with additional focus on...
Hello All, Is this issue fixed or something. Just want to check the most recent status on the java implementation. And also, I think bray-curtis distance is not a metric...
Hi Thanks for the response, I now understand it very well. I notice another hnsw implementation called granny (https://github.com/granne/granne), the index and query step are nearly done simultaneously and it...
Hello uwot developer, There is one more discussion I want to start: for annoy, random projection forest was constructed first but you still need to run the query step for...
As far as I know，No. We may need to explore a little bit or implement ourselves. I feel like it is at least as fast as annoy because searching nearest...
graph structure is essentially a list recording links to other elements with distance.
Hello James, I noticed that for the search step, annoy always uses 4 threads though I assigned 24 to it on a server, there are no acceleration compare to running...