-
Hi, I have a question regarding the implementation of the Asymmetric Minwise Hashing: Why is `MinHashLSHEnsemble` used instead of `MinHashLSH`? From my understanding, the asymmetric padding should tra…
-
Hi, this package looks really cool and I'd love to use it for my use case.
I have about 7,000 sets with about 1,000 elements each that I'm using as my index. I also have a set of about 1,000 quer…
-
Hi, I've read the original great paper :thumbsup: and the repo's readme.md. Now I have a question: Can I add new domain records into an existing indexer?
For example if I create an indexer with 1…
QthCN updated
2 years ago
-
Hi everyone,
I was following the [tutorial](http://ekzhu.com/datasketch/lshensemble.html#) on MinHashLSHEnsemble and I have a question.
I'm analyzing batch of data and for a given a query set, f…
-
Hi if i understand correctly,
the descriptor extractor returns a list DoubleFV , ie a list of double vectors.
For finding the similarity you find the minimum euclidean distance.
My idea is to sa…
-
How do we want the top-level functions?
Even in the two uses case in the gallery we have one with test data (the naive Bayes classifier) and one without. Should be always have a `Rcpp::Nullable` t…
-
-
### 路由地址
```routes
/inspirehep/authors/:id
/inspirehep/literature/:q
```
### 完整路由地址
```fullroutes
/inspirehep/authors/:id
/inspirehep/literature/:q
```
### 相关文档
https://docs.rsshub.app/routes…
-
Hello, I've seen that MinHash LSH Forest is a variation of MinHash LSH for top-k queries instead of threshold ones.
Is it possible to do top-k queries with MinHash LSH Ensemble?
-
微博内容精选