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.
Type de document :
Article dans une revue
Statistics and Computing, Springer Verlag (Germany), In press, 〈10.1007/s11222-018-9832-4〉
Liste complète des métadonnées

Littérature citée [48 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01621757
Contributeur : Marco Corneli <>
Soumis le : lundi 23 octobre 2017 - 17:54:14
Dernière modification le : mardi 2 octobre 2018 - 01:16:22
Document(s) archivé(s) le : mercredi 24 janvier 2018 - 15:32:20

Fichier

Dstbm_paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

435

Téléchargements de fichiers

209