cluster_by_igraph: Cluster similarity matrix by graph community detection...

In jokergoo/simplifyGO: Simplify Functional Enrichment Results

Cluster similarity matrix by graph community detection methods

Description

Cluster similarity matrix by graph community detection methods

Usage

cluster_by_igraph(mat,
    method = c("fast_greedy",
    "leading_eigen",
    "louvain",
    "walktrap"),
    ...)

Arguments

mat	The similarity matrix.
method	The community detection method.
...	Other arguments passed to the corresponding community detection function, see Details.

Details

The symmetric similarity matrix can be treated as an adjacency matrix and constructed as a graph/network with the similarity values as the weight of hte edges. Thus, clustering the similarity matrix can be treated as detecting clusters/modules/communities from the graph.

Four methods implemented in igraph package can be used here:

fast_greedy

uses cluster_fast_greedy.

leading_eigen

uses cluster_leading_eigen.

louvain

uses cluster_louvain.

walktrap

uses cluster_walktrap.

Value

A vector of cluster labels (in numeric).

Examples

# There is no example
NULL

jokergoo/simplifyGO documentation built on Oct. 25, 2023, 9:02 p.m.