REVIEW 3 cited by
Mixed membership stochastic blockmodels
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Mixed membership stochastic blockmodels
read the original abstract
Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic models can be delicate because the simple exchangeability assumptions underlying many boilerplate models no longer hold. In this paper, we describe a latent variable model of such data called the mixed membership stochastic blockmodel. This model extends blockmodels for relational data to ones which capture mixed membership latent relational structure, thus providing an object-specific low-dimensional representation. We develop a general variational inference algorithm for fast approximate posterior inference. We explore applications to social and protein interaction networks.
Forward citations
Cited by 3 Pith papers
-
Rank Is Not Capacity: Spectral Occupancy for Latent Graph Models
Spectra defines and controls effective capacity in graph embeddings via the Shannon effective rank of a trace-normalized kernel spectrum, making capacity a post-fit property rather than a pre-training hyperparameter.
-
Aitchison Embeddings for Learning Compositional Graph Representations
Graph nodes are embedded as simplex compositions via ILR coordinates to yield intrinsically interpretable representations that preserve Aitchison geometry and enable subcompositional analysis.
-
Aitchison Embeddings for Learning Compositional Graph Representations
Graph nodes are embedded as simplex compositions via ILR coordinates in Aitchison geometry to obtain interpretable representations that support component restriction and competitive task performance.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.