The deep latent position topic model for clustering and representation of networks with textual edges

Abstract Numerical interactions leading to users sharing textual content published by others are naturally represented by a network where the individuals are associated with the nodes and the exchanged texts with the edges. To understand those heterogeneous and complex data structures, clustering nodes into homogeneous groups as well as rendering a comprehensible visualization of the data is mandatory. To address both issues, we introduce Deep‐LPTM, a model‐based clustering strategy relying on a variational graph auto‐encoder approach and a probabilistic model to characterize the discussion topics. Deep‐LPTM allows to build a joint representation of the nodes and the edges in two embedding spaces. The parameters are inferred using a variational inference algorithm. We also introduce IC2L, a model selection criterion specifically designed to choose models with relevant clustering and visualization properties. An extensive benchmark study on synthetic data is provided. In particular, we find that Deep‐LPTM better recovers the partitions of the nodes than the state‐of‐the‐art ETSBM and STBM. Eventually, the emails of the Enron company are analyzed and visualizations of the results are presented, with meaningful highlights of the graph structure.

Authors

Institutions

Publication Details

Journal
Scandinavian Journal of Statistics
Published
2025-09-02
DOI
https://doi.org/10.1111/sjos.70016
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The deep latent position topic model for clustering and representation of networks with textual edges

Pierre Latouche, Charles Bouveyron, Rémi Boutin
Scandinavian Journal of Statistics
Complex Network Analysis Techniques
article

The deep latent position topic model for clustering and representation of networks with textual edges

Pierre Latouche, Charles Bouveyron, Rémi Boutin
article en

Abstract

Abstract Numerical interactions leading to users sharing textual content published by others are naturally represented by a network where the individuals are associated with the nodes and the exchanged texts with the edges. To understand those heterogeneous and complex data structures, clustering nodes into homogeneous groups as well as rendering a comprehensible visualization of the data is mandatory. To address both issues, we introduce Deep‐LPTM, a model‐based clustering strategy relying on a variational graph auto‐encoder approach and a probabilistic model to characterize the discussion topics. Deep‐LPTM allows to build a joint representation of the nodes and the edges in two embedding spaces. The parameters are inferred using a variational inference algorithm. We also introduce IC2L, a model selection criterion specifically designed to choose models with relevant clustering and visualization properties. An extensive benchmark study on synthetic data is provided. In particular, we find that Deep‐LPTM better recovers the partitions of the nodes than the state‐of‐the‐art ETSBM and STBM. Eventually, the emails of the Enron company are analyzed and visualizations of the results are presented, with meaningful highlights of the graph structure.

Scandinavian Journal of StatisticsVol. 52(4)
Centre National de la Recherche Scientifique (FR), Institut Universitaire de France (FR), Université Paris Cité (FR), Sorbonne Paris Cité (FR), Laboratoire Jean-Alexandre Dieudonné (FR), Clermont Université (FR), Laboratoire de Mathématiques Blaise Pascal (FR), Mathématiques Appliquées à Paris 5 (FR)
Openalex Percentile: Top 100%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.