Cluster an adjacency matrix

Usage

cluster_graph_leiden(snn, resolution = 0.001, seed = 12531, ...)

cluster_graph_louvain(snn, resolution = 1, seed = 12531)

cluster_graph_seurat(snn, resolution = 0.8, ...)

Arguments

snn: Symmetric adjacency matrix (dgCMatrix) output from e.g. knn_to_snn_graph. Only the lower triangle is used
resolution: Resolution parameter. Higher values result in more clusters
seed: Random seed for clustering initialization
...: Additional arguments to underlying clustering function

Value

Factor vector containing the cluster assignment for each cell.

Details

cluster_graph_leiden: Leiden graph clustering algorithm igraph::cluster_leiden()

cluster_graph_louvain: Louvain graph clustering algorithm igraph::cluster_louvain()

cluster_graph_seurat: Seurat's clustering algorithm Seurat::FindClusters()