Graph Summarization with Latent Variable Probabilistic Models
From MaRDI portal
Publication:5050353
Recommendations
- Direction matters: on influence-preserving graph summarization and max-cut principle for directed graphs
- Graph summarization with quality guarantees
- Faster compression methods for a weighted graph using locality sensitive hashing
- Online summarization of dynamic graphs using subjective interestingness for sequential data
- An efficient weighted graph aggregation algorithm
Cites work
- A linear-time algorithm for computing the multinomial stochastic complexity
- A universal prior for integers and estimation by minimum description length
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Graph summarization with quality guarantees
- scientific article; zbMATH DE number 4095371 (Why is no real title available?)
- Model Change Detection With the MDL Principle
- Modeling by shortest data description
- Optimal estimation of parameters
- The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
- Uncovering latent structure in valued graphs: a variational approach
Cited in
(2)
This page was built for publication: Graph Summarization with Latent Variable Probabilistic Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050353)