The dynamic stochastic topic block model for dynamic networks with textual edges

Abstract : The present paper develops a probabilistic model to cluster the nodes of a dynamic graph, accounting for the content of textual edges as well as their frequency. Ver-tices are clustered in groups which are homogeneous both in terms of interaction frequency and discussed topics. The dynamic graph is considered stationary on a latent time interval if the proportions of topics discussed between each pair of node groups do not change in time during that interval. A classification variational expectation-maximization (C-VEM) algorithm is adopted to perform inference. A model selection criterion is also derived to select the number of node groups, time clusters and topics. Experiments on simulated data are carried out to assess the proposed methodology. We finally illustrate an application to the Enron dataset.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [48 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01621757
Contributor : Marco Corneli <>
Submitted on : Monday, October 23, 2017 - 5:54:14 PM
Last modification on : Thursday, April 11, 2019 - 4:02:09 PM
Document(s) archivé(s) le : Wednesday, January 24, 2018 - 3:32:20 PM

File

Dstbm_paper.pdf
Files produced by the author(s)

Identifiers

Citation

Marco Corneli, Charles Bouveyron, Pierre Latouche, Fabrice Rossi. The dynamic stochastic topic block model for dynamic networks with textual edges. Statistics and Computing, Springer Verlag (Germany), In press, ⟨10.1007/s11222-018-9832-4⟩. ⟨hal-01621757⟩

Share

Metrics

Record views

650

Files downloads

343