-
So a brute force approach works well with a few locations. But as the number of locations increases, it becomes progressively less efficient.
How would you change things if you needed to handle a f…
-
This is a feature request to provide some extensions of the `igraph_path_length_hist()` functionality (possibly implemented as a separate function):
1. Allow weighted path lengths. This would be a ve…
-
**Is your feature request related to a problem? Please describe.**
The current 'distance' APIs in [here](https://github.com/rapidsai/raft/blob/branch-22.06/cpp/include/raft/distance/distance.cuh) acc…
-
Hi everyone!
For anyone trying to implement this paper or use this repo, here’s a heads-up: we reached out to the authors with some questions because there are quite a few ambiguities and missing d…
-
Review the computational efficiency of returning a proximity matrix with H2O-3's Distributed Random Forest and consider adding something similar to the proximity matrix that R's [Random Forest impleme…
-
Hello! I am trying to use the tool with the SPC measure, but the incremental methods are not implemented in SANA.cpp. Is there a way to maximize the SPC measure without changing the source code? There…
-
**Have added**
- [x] confint.lm
- [x] nobs.lm
- [x] predict.lm - fix this to use the right variance
- [x] print.lm
- [x] summary.lm
- [x] tidy.lm
- [x] vcov.lm
**Will add**
- [ ] an…
-
I came across https://github.com/scikit-learn/scikit-learn/issues/17813 which suggests calculating Mahalanobis distance as:
d = xT.VI.x + yT.VI.y - xT.VI.y - yT.VI.x
instead of
d = (x-y)T.VI.(x-y)
…
-
Is there a better (computationally cheaper) way to quantify the relationship between a source>target time series instead of setting the lower triangle matrix to inf after computing it?
```
# These 2…
-
It would be good to add some functionality to cluster the inferred ASVs into OTUs based on a pairwise identity threshold.
This can be particularly useful for interpretting assignments that were mad…