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

Files in This Item:
 File SizeFormat
Downloadinsight_publication.pdf3.15 MBAdobe PDF
Title: Inferring structure in bipartite networks using the latent block model and exact ICL
Authors: Wyse, JasonFriel, NialLatouche, Pierre
Permanent link:
Date: 1-Feb-2017
Online since: 2017-03-29T12:32:26Z
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 blockmodel. 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.
Funding Details: Science Foundation Ireland
Type of material: Journal Article
Publisher: Cambridge University Press
Journal: Network Science
Volume: 5
Issue: 1
Start page: 45
End page: 69
Copyright (published version): 2017 Cambridge University Press
Keywords: Machine learningStatistics
DOI: 10.1017/nws.2016.25
Language: en
Status of Item: Peer reviewed
This item is made available under a Creative Commons License:
Appears in Collections:Mathematics and Statistics Research Collection
Insight Research Collection

Show full item record

Citations 20

Last Week
Last month
checked on Sep 12, 2020

Page view(s)

Last Week
Last month
checked on Jan 23, 2022


checked on Jan 23, 2022

Google ScholarTM



If you are a publisher or author and have copyright concerns for any item, please email and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.