Skip to main navigation Skip to search Skip to main content

Exact ICL maximization in a non-stationary time extension of the latent block model for dynamic networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The latent block model (LBM) is a exible probabilistic tool to describe interactions between node sets in bipartite networks, but it does not account for interactions of time varying intensity between nodes in unknown classes. In this paper we propose a non stationary temporal extension of the LBM that clusters simultaneously the two node sets of a bipartite network and constructs classes of time intervals on which interactions are stationary. The number of clusters as well as the membership to classes are obtained by maximizing the exact complete-data integrated likelihood relying on a greedy search approach. Experiments on simulated and real data are carried out in order to assess the proposed methodology.

Original languageEnglish
Title of host publication23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings
Publisheri6doc.com publication
Pages225-230
Number of pages6
ISBN (Electronic)9782875870148
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Bruges, Belgium
Duration: 22 Apr 201524 Apr 2015

Publication series

Name23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings

Conference

Conference23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015
Country/TerritoryBelgium
CityBruges
Period22/04/1524/04/15

Fingerprint

Dive into the research topics of 'Exact ICL maximization in a non-stationary time extension of the latent block model for dynamic networks'. Together they form a unique fingerprint.

Cite this