Inferring structure in bipartite networks using the latent block model and exact ICL - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2014

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

Résumé

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.

Domaines

Calcul [stat.CO]

Dates et versions

hal-00984397 , version 1 (28-04-2014)

Identifiants

Citer

Jason Wyse, Nial Friel, Pierre Latouche. Inferring structure in bipartite networks using the latent block model and exact ICL. 2014. ⟨hal-00984397⟩
153 Consultations
0 Téléchargements

Altmetric

Partager

More