Discovering Patterns in Time-Varying Graphs: A Triclustering Approach - Université Paris 1 Panthéon-Sorbonne Accéder directement au contenu
Article Dans Une Revue Advances in Data Analysis and Classification Année : 2018

Discovering Patterns in Time-Varying Graphs: A Triclustering Approach

Résumé

This paper introduces a novel technique to track structures in time varying graphs. The method uses a maximum a posteriori approach for adjusting a three-dimensional co-clustering of the source vertices, the destination vertices and the time, to the data under study, in a way that does not require any hyper-parameter tuning. The three dimensions are simultaneously segmented in order to build clusters of source vertices, destination vertices and time segments where the edge distributions across clusters of vertices follow the same evolution over the time segments. The main novelty of this approach lies in that the time segments are directly inferred from the evolution of the edge distribution between the vertices, thus not requiring the user to make any a priori quantization. Experiments conducted on artificial data illustrate the good behavior of the technique, and a study of a real-life data set shows the potential of the proposed approach for exploratory data analysis.
Fichier principal
Vignette du fichier
temporal.pdf (1.99 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01356993 , version 1 (28-08-2016)

Licence

Paternité - Partage selon les Conditions Initiales

Identifiants

Citer

Romain Guigourès, Marc Boullé, Fabrice Rossi. Discovering Patterns in Time-Varying Graphs: A Triclustering Approach. Advances in Data Analysis and Classification, 2018, 12 (3), pp.509-536. ⟨10.1007/s11634-015-0218-6⟩. ⟨hal-01356993⟩
262 Consultations
222 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More