BuildKNNGraphLaplacians | R Documentation |
Generate graph Laplacians for graph regularization of
jrSiCKLSNMF from the list of raw count matrices using a KNN graph. Note that this
is only appropriate when the number of features is considerably greater
than the number of cells in all modalities. If this is not the case, please use
BuildSNNGraphLaplacians
or any other method of graph
construction that does not rely on the Euclidean distance and store the graph Laplacians for
each modality as a list in the graph.laplacian.list
slot.
BuildKNNGraphLaplacians(SickleJr, k = 20)
SickleJr |
An object of class SickleJr |
k |
Number of KNN neighbors to calculate; by default, is set to 20 |
An object of class SickleJr with a list of graph Laplacians in sparse matrix format
added to the graph.laplacian.list
slot
Lun2016jrSiCKLSNMF
SimSickleJrSmall<-BuildKNNGraphLaplacians(SimSickleJrSmall)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.