Description Usage Arguments Value
View source: R/funs_top_clustering_bffs_v7.R
Given a patient similarity network, for each patient class, it iterates the BFC algorithm in order to create small subclasses of similar patients.
1 | reduce_net(mat, nAs, thGroup = 0.2, thW = 0.2, A_bol = T)
|
mat |
adjacency matrix of a patient similarity network |
nAs |
number of patients composing the second class |
thGroup |
Default 0.2, double value between 0 and 1 determining the percentage of best friends to keep in the end as final subclass |
thW |
Default 0.2, double value between 0 and 1 determining the percentage of best friends to considers for a root (1BFS are the 60 percentage of the patients most similar to the root) |
A_bol |
Default TRUE, if the first class is signature class of the PSN passed as matrix (mat) |
The nodes of each subclass that must be kept in the plot and the nodes that must be summerized in the legend
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.