-
**Describe the bug**
The `similarity_jaccard` method in python-igraph seems to ignore self-loops, while they are actually counted as neighbors. This leads to a discrepancy in the Jaccard similarity c…
-
### Is your feature request related to a problem? Please describe.
Upon reviewing the Boolean distance metrics in `scipy.spatial.distance`, I find a number of inconsistencies with respect to non-Bo…
-
Dr. Yahui Long,
Sorry to bother you. I have a couple of questions and issues regarding the calculation of two unsupervised metrics. I have read your SpatialGlue paper and code, but I'm encountering…
-
Hey,
I've been looking at the PARC code, and i noticed that in lines 298-306 (PARC/parc/_parc.py), you first create edgelist and then make a copy of edgelist. The copy is then used in the following…
-
Jaccard similarity of word bigrams is a much more efficient way of finding document similarities.
-
作者您好,请问公式(9)的结果是一个值还是一个向量?
能否请您举个例子说明?十分感谢
-
The HyperMinHash Jaccard similarity calculation appears to only compare the "mantissa" portion of the register to increase c, rather than the whole register. The algorithm 2.1.4 in the paper seems to…
-
I conducted a semantic similarity calculation experiment where I noticed that the Jaccard Similarity Score values of certain records differed when I used the `--information-content-file` option. I am …
-
So far we have PA-VAE up until 11340 drugs (see #1 ). The models are qsar-tested on 500 test samples.
- Aug 16 10:34 averaged_metrics_for_zinc_paired_encoder2_252_to_11340_test_size_500.npy
For S…
-
Currently, GeaFlow has implemented many graph computing algorithms, but there are still some graph algorithms that have not been implemented. Please implement the Jaccard Similarity algorithm.