Uncovering latent structure in valued graphs: a variational approach
From MaRDI portal
Publication:993244
DOI10.1214/10-AOAS361zbMath1194.62125arXiv1011.1813WikidataQ60560752 ScholiaQ60560752MaRDI QIDQ993244
Corinne Vacher, Mahendra Mariadassou, Stephane Robin
Publication date: 10 September 2010
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1813
variational methodrandom graphmixture modellatent structurehost-parasite interactionsvalued graphecological networks
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (52)
The dynamic random subgraph model for the clustering of evolving networks ⋮ Bayesian testing for exogenous partition structures in stochastic block models ⋮ Improved Bayesian inference for the stochastic block model with application to large networks ⋮ Hierarchical Community Detection by Recursive Partitioning ⋮ Overlapping community detection in weighted networks via a Bayesian approach ⋮ Variational Inference for Latent Space Models for Dynamic Networks ⋮ A stochastic block model approach for the analysis of multilevel networks: an application to the sociology of organizations ⋮ Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models ⋮ Graph Summarization with Latent Variable Probabilistic Models ⋮ Powerful multiple testing of paired null hypotheses using a latent graph model ⋮ Community detection by \(L_{0}\)-penalized graph Laplacian ⋮ Bayesian degree-corrected stochastic blockmodels for community detection ⋮ On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization ⋮ Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models ⋮ Edge Exchangeable Models for Interaction Networks ⋮ Identifiability and parameter estimation of the overlapped stochastic co-block model ⋮ Variational algorithms for biclustering models ⋮ Spectral clustering-based community detection using graph distance and node attributes ⋮ Hierarchical clustering with discrete latent variable models and the integrated classification likelihood ⋮ Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure ⋮ Mixture models and networks: The stochastic blockmodel ⋮ Community detection with structural and attribute similarities ⋮ Poisson degree corrected dynamic stochastic block model ⋮ Directed Community Detection With Network Embedding ⋮ Hierarchical Network Models for Exchangeable Structured Interaction Processes ⋮ Community detection for multilayer weighted networks ⋮ Parameter identifiability in a class of random graph mixture models ⋮ Embedded topics in the stochastic block model ⋮ Covariate-Informed Latent Interaction Models: Addressing Geographic & Taxonomic Bias in Predicting Bird–Plant Interactions ⋮ Consistency of maximum-likelihood and variational estimators in the stochastic block model ⋮ Inferring sparse Gaussian graphical models with latent structure ⋮ Consistency and asymptotic normality of stochastic block models estimators from sampled data ⋮ Model-based clustering of large networks ⋮ Accuracy of variational estimates for random graph mixture models ⋮ Model selection in overlapping stochastic block models ⋮ Pseudo-likelihood methods for community detection in large sparse networks ⋮ Variational Inference for Stochastic Block Models From Sampled Data ⋮ Exponential-family random graph models for valued networks ⋮ Variational Bayesian inference and complexity control for stochastic block models ⋮ The stochastic topic block model for the clustering of vertices in networks with textual edges ⋮ Uncovering latent structure in valued graphs: a variational approach ⋮ A goodness-of-fit test for stochastic block models ⋮ Optimization via low-rank approximation for community detection in networks ⋮ Detection of structurally homogeneous subsets in graphs ⋮ Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood ⋮ Community detection with dependent connectivity ⋮ Goodness of Fit of Logistic Regression Models for Random Graphs ⋮ Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication ⋮ Weighted stochastic block model ⋮ Convergence of the groups posterior distribution in latent or stochastic block models ⋮ Estimation and model selection for model-based clustering with the conditional classification likelihood ⋮ Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm
Uses Software
Cites Work
- Uncovering latent structure in valued graphs: a variational approach
- Variational approximations in Bayesian model selection for finite mixture distributions
- An introduction to variational methods for graphical models
- Consistency of spectral clustering
- A Tighter Bound for Graphical Models
- Statistical mechanics of complex networks
- Mixed membership stochastic blockmodels
- Emergence of Scaling in Random Networks
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- An Exponential Family of Probability Distributions for Directed Graphs
- Estimation and Prediction for Stochastic Blockstructures
- Random graph models of social networks
- Community structure in social and biological networks
- Advances in Intelligent Data Analysis VI
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Uncovering latent structure in valued graphs: a variational approach
