Learning Bipartite Graphs: Heavy Tails and Multiple Components

Documentation for package ‘finbipartite’ version 0.1.0

learn_bipartite_graph_nie	Laplacian matrix of a k-component bipartite graph via Nie's method Computes the Laplacian matrix of a bipartite graph on the basis of an observed similarity matrix.
learn_connected_bipartite_graph_pgd	Laplacian matrix of a connected bipartite graph with Gaussian data Computes the Laplacian matrix of a bipartite graph on the basis of an observed data matrix.
learn_heavy_tail_bipartite_graph_pgd	Laplacian matrix of a connected bipartite graph with heavy-tailed data Computes the Laplacian matrix of a bipartite graph on the basis of an observed data matrix whose distribution is assumed to be Student-t.
learn_heavy_tail_kcomp_bipartite_graph	Laplacian matrix of a k-component bipartite graph with heavy-tailed data Computes the Laplacian matrix of a k-component bipartite graph on the basis of an observed data matrix whose distribution is assumed to be Student-t.