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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [53 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01299161
Contributor : Pierre Latouche <>
Submitted on : Thursday, April 7, 2016 - 11:57:47 AM
Last modification on : Friday, September 20, 2019 - 4:34:03 PM
Long-term archiving on: Monday, November 14, 2016 - 7:30:20 PM

File

article-STBM.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Charles Bouveyron, P Latouche, R Zreik. The stochastic topic block model for the clustering of vertices in networks with textual edges. Statistics and Computing, Springer Verlag (Germany), 2016, ⟨10.1007/s11222-016-9713-7⟩. ⟨hal-01299161⟩

Share

Metrics

Record views

1726

Files downloads

982