-
Our current implementation computed subject-wise correlation matrices, fisher's r2zs them, computes the euclidean mean and then inverts the fisher's r2z (i.e. z2r)
We could explore other distance f…
-
Accidentally somewhere in my code, I called `gcdx` for polynomials in `ZZ[:x]` instead of `QQ[:x]`. This led to my tests not terminating 😞 Here some example code:
```julia
ZZx, x = ZZ[:x]
gcdx(x,…
-
Convolutional Neural Networks, Recurrent Neural Networks, and other deep learning approaches have achieved unprecedented performance on a broad range of problems (e.g. Computer Vision and Speech Recog…
-
#### Description
Precomputed distances are treated as "unsupported" by AgglomerativeClustering, regardless of the provenance. (e.g. sklearn.metrics.euclidean_distances)
This restriction makes it…
-
It be very helpful to describe some examples, particularly in connection with the heat kernel estimates.
- Euclidean space. Here Tychonoff's example shows non-uniqueness of solutions of the heat eq…
-
## Reproduction:
Reproduction steps:
1. Acquire 2-3 friendly surgeons and an HARS mutator. Fill them in on the plan ahead of time, as it will be difficult to communicate with them during the proce…
-
In the rASR matlab implementation, the geometric median is euclidean.
For now, python RASR uses also the euclidean geometric median (with the different optimization method though).
We might want …
-
It seems that the non-random unoptimized arrays are at the far end of the poorest designs in a very skewed distribution for variance of the Euclidean distance for some constructions.
-
I believe that our current functions for computing the max-min ordering and nearest neighbors could be improved to reduce running time. Specifically, I believe our current implementations are O(n^2) b…
-
Running into the following error:
```
Error in non_iid: If a knn_graph is not provided, features must be provided to fit a new knn.
Failed to check for these issue types: [NonIIDIssueManager]
``…