Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Inferring structure in bipartite networks using the latent block model and exact ICL

Abstract : We consider the task of simultaneous clustering of the two node sets involved in a bipartite network. The approach we adopt is based on use of the exact integrated complete likelihood for the latent block model. Using this allows one to infer the number of clusters as well as cluster memberships using a greedy search. This gives a model-based clustering of the node sets. Experiments on simulated bipartite network data show that the greedy search approach is vastly more scalable than competing Markov chain Monte Carlo based methods. Application to a number of real observed bipartite networks demonstrate the algorithms discussed.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00984397
Contributor : Pierre Latouche <>
Submitted on : Monday, April 28, 2014 - 1:10:56 PM
Last modification on : Sunday, January 19, 2020 - 6:38:32 PM

Links full text

Identifiers

  • HAL Id : hal-00984397, version 1
  • ARXIV : 1404.2911

Collections

Citation

Jason Wyse, Nial Friel, Pierre Latouche. Inferring structure in bipartite networks using the latent block model and exact ICL. 2014. ⟨hal-00984397⟩

Share

Metrics

Record views

365