Model selection in overlapping stochastic block models
From MaRDI portal
Publication:2015159
Abstract: Networks are a commonly used mathematical model to describe the rich set of interactions between objects of interest. Many clustering methods have been developed in order to partition such structures, among which several rely on underlying probabilistic models, typically mixture models. The relevant hidden structure may however show overlapping groups in several applications. The Overlapping Stochastic Block Model (2011) has been developed to take this phenomenon into account. Nevertheless, the problem of the choice of the number of classes in the inference step is still open. To tackle this issue, we consider the proposed model in a Bayesian framework and develop a new criterion based on a non asymptotic approximation of the marginal log-likelihood. We describe how the criterion can be computed through a variational Bayes EM algorithm, and demonstrate its efficiency by running it on both simulated and real data.
Recommendations
- Overlapping stochastic block models with application to the French political blogosphere
- Variational Bayesian inference and complexity control for stochastic block models
- Likelihood-based model selection for stochastic block models
- Non-parametric overlapping community detection
- Stochastic blockmodels with a growing number of classes
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1059776 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- A nonparametric view of network models and Newman–Girvan and other modularities
- Accuracy of variational estimates for random graph mixture models
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- Community structure in social and biological networks
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Exact and Monte Carlo calculations of integrated likelihoods for the latent class model
- Fast online graph clustering via Erdős-Rényi mixture
- Mixed membership stochastic blockmodels
- Overlapping stochastic block models with application to the French political blogosphere
- Pattern recognition and machine learning.
- Statistical mechanics of complex networks
- Stochastic Blockmodels for Directed Graphs
- Uncovering latent structure in valued graphs: a variational approach
Cited in
(15)- The deep latent position block model for block clustering and latent representation of nodes in networks
- Adaptive estimation in structured factor models with applications to overlapping clustering
- Detecting overlapping communities in networks using spectral methods
- The dynamic random subgraph model for the clustering of evolving networks
- Comparative study for inference of hidden classes in stochastic block models
- Hierarchical Network Models for Exchangeable Structured Interaction Processes
- Non-parametric overlapping community detection
- Modeling the social media relationships of Irish politicians using a generalized latent space stochastic blockmodel
- Model-based clustering of multiple networks with a hierarchical algorithm
- Likelihood-based model selection for stochastic block models
- Weighted stochastic block model
- Variational Bayesian inference and complexity control for stochastic block models
- Goodness of Fit of Logistic Regression Models for Random Graphs
- Overlapping stochastic block models with application to the French political blogosphere
- Estimation and selection for the latent block model on categorical data
This page was built for publication: Model selection in overlapping stochastic block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015159)
