Discovering patterns in time-varying graphs: a triclustering approach

DOI10.1007/s11634-015-0218-6zbMath1416.62375arXiv1608.07929OpenAlexW3099506693MaRDI QIDQ1630871

Romain Guigourès, Marc Boullé, Fabrice Rossi

Publication date: 5 December 2018

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.07929

zbMATH Keywords

model selectionco-clusteringgraph miningtime-varying graph

Mathematics Subject Classification ID

Multivariate analysis (62H99) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Dynamic stochastic block models: parameter estimation and detection of changes in community structure ⋮ The dynamic stochastic topic block model for dynamic networks with textual edges

Uses Software

• PMTK
• GraphScope

Cites Work

• Unnamed Item
• Unnamed Item
• Latent Block Model for Contingency Table
• A Mathematical Theory of Communication
• Graph clustering
• A state-space mixed membership blockmodel for dynamic network tomography
• Three-mode partitioning
• Divergence measures based on the Shannon entropy
• Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
• Classification of Text Documents
• Estimation and Prediction for Stochastic Blockstructures
• 10.1162/153244303321897735
• Two-mode clustering methods: astructuredoverview
• A Survey of Statistical Network Models
• Elements of Information Theory
• Variable neighborhood search: Principles and applications

This page was built for publication: Discovering patterns in time-varying graphs: a triclustering approach