bipartite_matching_collapsed: Bipartite to unipartite matching via collapsing the bipartite...

In jesusdaniel/rBipartiteUnipartiteMatch: Graph Matching between Bipartite and Unipartite Networks

Description

This function performs graph matching between a bipartite and a unipartite graphs that are assumed to share a common set of vertices. The method performs an alignment of the edges of the unipartite graphs with the edges of a collapsed bipartite graph into a unipartite, following the collapsed representation selected.

Usage

bipartite_matching_collapsed(
  A,
  B,
  collapsed_method = c("omp", "corr", "cov", "glasso", "mb"),
  seeds = NULL
)

Arguments

A	Adjacency matrix of the unipartite graph.
B	Bipartite graph incidence matrix, where rows correspond to the vertices in common with the unipartite graph.
collapsed_method	Collapsed representation for the bipartite graph. The options are one-mode projection (\textttomp), correlation (\textttcorr), covariance (\textttcov), graphical lasso (\textttglasso) or nodewise regression (\textttmb).
seeds	If some vertices have known correspondence, a vector containing the indexes of these vertices can be passed through this parameter, and the corresponding rows of A and B are assumed to be aligned. The algorithm will then match the remaining vertices. The default is NULL if no seeds are available.

Value

A permutation Q that approximately minimizes the difference between the edges of A and the collapsed B.

jesusdaniel/rBipartiteUnipartiteMatch documentation built on Dec. 20, 2021, 11:06 p.m.