The stochastic topic block model for the clustering of vertices in networks with textual edges - Archive ouverte HAL Access content directly
Journal Articles Statistics and Computing Year : 2016

The stochastic topic block model for the clustering of vertices in networks with textual edges

Abstract

Due to the significant increase of communications between individuals via social medias (Face-book, Twitter) or electronic formats (email, web, co-authorship) in the past two decades, network analysis has become a unavoidable discipline. Many random graph models have been proposed to extract information from networks based on person-to-person links only, without taking into account information on the contents. In this paper, we have developed the stochastic topic block model (STBM) model, a probabilistic model for networks with textual edges. We address here the problem of discovering meaningful clusters of vertices that are coherent from both the network interactions and the text contents. A classification variational expectation-maximization (C-VEM) algorithm is proposed to perform inference. Simulated data sets are considered in order to assess the proposed approach and highlight its main features. Finally, we demonstrate the effectiveness of our model on two real-word data sets: a communication network and a co-authorship network.
Fichier principal
Vignette du fichier
article-STBM.pdf (2.03 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01299161 , version 1 (07-04-2016)

Identifiers

Cite

Charles Bouveyron, P Latouche, Rawya Zreik. The stochastic topic block model for the clustering of vertices in networks with textual edges. Statistics and Computing, 2016, ⟨10.1007/s11222-016-9713-7⟩. ⟨hal-01299161⟩
1111 View
811 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More