Description Usage Arguments Value Examples

Fuse affinity networks (i.e., matrices) through one-step or two-step random walk

1 2 |

`Wall` |
a list of affinity matrices of the same shape. |

`K` |
the number of k nearest neighbors for function kNN_graph |

`weight` |
a list of non-negative real numbers (which will be normalized internally so that it sums to 1) that one-to-one correspond to the affinity matrices included in 'Wall'. If not set, internally uniform weights are assigned to all affinity matrices in 'Wall'. |

`type` |
choose one of the two options: perform "one-step" random walk, or "two-step" random walk on the list of affinity matrices in 'Wallâ€œ to generate a fused affinity matrix. Default: "two-step" random walk |

`alpha` |
a list of eight non-negative real numbers (which will be normalized internally to make it sums to 1). Only used when "two-step" (default value of 'type') random walk is used. 'alpha' is the weights for eight terms in the "two-step" random walk formula (check research paper for more explanations about the terms). Default value: (1, 1, 0, 0, 0, 0, 0, 0), i.e., only use the first two terms (since they are most effective in practice). |

`verbose` |
logical(1); if true, print some information |

a fused transition matrix (representing a fused network)

1 2 3 4 5 | ```
D1 = matrix(runif(400), nrow=20)
W1 = affinity_matrix(D1, 5)
D2 = matrix(runif(400), nrow=20)
W2 = affinity_matrix(D1, 5)
W = ANF(list(W1, W2), K=10)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.