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 media (Face-book, Twitter, Linkedin) or electronic formats (email, web, e-publication) 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. This paper introduces the stochastic topic block model (STBM), a prob-abilistic 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 to highlight its main features. Finally, we demonstrate the effectiveness of our methodology on two real-word data sets: a directed communication network and a undirected co-authorship network.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01519743
Contributor : Pierre Latouche <>
Submitted on : Tuesday, May 9, 2017 - 11:26:17 AM
Last modification on : Sunday, January 19, 2020 - 6:38:32 PM
Long-term archiving on: Thursday, August 10, 2017 - 12:50:49 PM

Files

Identifiers

Collections

Citation

Charles Bouveyron, Pierre Latouche, Rawya 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-01519743⟩

Share

Metrics

Record views

483

Files downloads

330