You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In case of a fixed knn and re-calculation of the map with different parameters of e.g. decay or gamma, this is a purely redundant overhead that could be avoided. I thought passing to init a previous phate object with at least the same knn parameters would help the issue, but apparently the only place where it speeds up the things is when we recompute using a different t.
If i want to avoid to recalculate PCA and KNN graph each time, should i pass a pre-computed affinity matrix to the data variable, as instructed in the man page of phateR::phate? If so, can I use knn graph, generated by Seurat's FindNeighbors function for that purpose?
Thank you in advance.
The text was updated successfully, but these errors were encountered:
I was hoping on saving some time on computation as each time
phateR::phate
runs, ~75% of time goes to PCA and KNN graph calculation:In case of a fixed
knn
and re-calculation of the map with different parameters of e.g.decay
orgamma
, this is a purely redundant overhead that could be avoided. I thought passing toinit
a previousphate
object with at least the same knn parameters would help the issue, but apparently the only place where it speeds up the things is when we recompute using a differentt
.If i want to avoid to recalculate PCA and KNN graph each time, should i pass a pre-computed
affinity matrix
to thedata
variable, as instructed in the man page ofphateR::phate
? If so, can I use knn graph, generated by Seurat'sFindNeighbors
function for that purpose?Thank you in advance.
The text was updated successfully, but these errors were encountered: