-
This might be a naive question but I am unable to understand how to use metric MDS. When following the examples in the documentation, I only get classical MDS out. In the documentation, an example for…
-
Hi! Is Voyager intended to handle missing values in some way? It might be useful to allow missing values in the query vector, in which case I think the search should consider other elements only. …
-
Some metric/feature combinations are inappropriate and will calls AD index calculations to fail. For example, Jaccard distance with RDKit features results in a pairwise distance matrix that is all zer…
-
I'm thinking it might be worthwhile to try to replace the euclidean distances used in kd-tree and ball-tree here:
https://github.com/scikit-learn/scikit-learn/blob/master/sklearn/neighbors/_dist_metr…
-
When the numpy random seed is set to [unlucky number 13](https://en.wikipedia.org/wiki/Triskaidekaphobia), this code snippet:
```python
from pynndescent import NNDescent
X = np.load("X.npy")
np.…
-
Firstly, thank you for the great work and for sharing the codebase for the same. I wanted to you your approach for encoding an adjacency matrix of a graph. All the implementations provided assume ther…
-
Hello tslearn community,
I was wondering how TSK works with DTW distance. In Euclidean Distance, we know that the goal is to minimize the sum of squares of distances to centers. Right?
However,…
-
> I’ve been using ‘ensembleGBdist’ for some calculations and I’m a bit confused by the results if I use the ‘euclidean’ option. Here are parity plots comparing the distances obtained for the 388 Olmst…
-
1. Use squared Euclidean distance Instead of full Euclidean distance between atoms - avoid computing sqrt. In function `getRclash` v `kernels/classification.cl` return squared distances (e.g., 2.5 -…
nejci updated
2 years ago
-
Hi developers,
I have a situation, where I am using the VRPsolvereasy, and entering in the 'latitude' and longitude for different counties in Pennsylvania that are closest to Pittsburg airport. I'm…