Graph Summarization with Latent Variable Probabilistic Models

DOI10.1007/978-3-030-93413-2_36OpenAlexW4206611652MaRDI QIDQ5050353

Ryoga Kanai, Shintaro Fukushima, Kenji Yamanishi

Publication date: 15 November 2022

Published in: Complex Networks & Their Applications X (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-93413-2_36

zbMATH Keywords

information theoryminimum description length principlegraph summarizationlatent variable probabilistic modelmachine learning and data miningnormalized maximum likelihood code-length

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Uncovering latent structure in valued graphs: a variational approach
• A universal prior for integers and estimation by minimum description length
• Modeling by shortest data description
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Graph summarization with quality guarantees
• The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
• A linear-time algorithm for computing the multinomial stochastic complexity
• Optimal Estimation of Parameters
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Model Change Detection With the MDL Principle

This page was built for publication: Graph Summarization with Latent Variable Probabilistic Models