Bayesian learning of graph substructures
From MaRDI portal
Abstract: Graphical models provide a powerful methodology for learning the conditional independence structure in multivariate data. Inference is often focused on estimating individual edges in the latent graph. Nonetheless, there is increasing interest in inferring more complex structures, such as communities, for multiple reasons, including more effective information retrieval and better interpretability. Stochastic blockmodels offer a powerful tool to detect such structure in a network. We thus propose to exploit advances in random graph theory and embed them within the graphical models framework. A consequence of this approach is the propagation of the uncertainty in graph estimation to large-scale structure learning. We consider Bayesian nonparametric stochastic blockmodels as priors on the graph. We extend such models to consider clique-based blocks and to multiple graph settings introducing a novel prior process based on a Dependent Dirichlet process. Moreover, we devise a tailored computation strategy of Bayes factors for block structure based on the Savage-Dickey ratio to test for presence of larger structure in a graph. We demonstrate our approach in simulations as well as on real data applications in finance and transcriptomics.
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 509150 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 774881 (Why is no real title available?)
- A Bayesian analysis of some nonparametric problems
- A Bayesian nonparametric latent space approach to modeling evolving communities in dynamic networks
- A Method for Combining Inference Across Related Nonparametric Bayesian Models
- A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
- A general framework for Bayes structured linear models
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
- A robust procedure for Gaussian graphical model search from microarray data with p larger than n
- An ANOVA Model for Dependent Random Measures
- Bayesian cluster analysis
- Bayesian clustering in decomposable graphs
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels
- Bayesian graph selection consistency under model misspecification
- Bayesian graphical models for differential pathways
- Bayesian graphical models for modern biological applications
- Bayesian inference for high-dimensional decomposable graphs
- Bayesian inference for multiple Gaussian graphical models with application to metabolic association networks
- Bayesian inference of multiple Gaussian graphical models
- Bayesian testing for exogenous partition structures in stochastic block models
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Community detection and stochastic block models: recent developments
- Dependent Modeling of Temporal Sequences of Random Partitions
- Dynamic degree-corrected blockmodels for social networks: A nonparametric approach
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Extended stochastic block models with application to criminal networks
- Handbook of Graphical Models
- Hierarchical Dirichlet Processes
- High-dimensional covariance estimation based on Gaussian graphical models
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Inferring sparse Gaussian graphical models with latent structure
- Joint structural estimation of multiple graphical models
- Latent nested nonparametric priors (with discussion)
- Marginal Likelihood and Bayes Factors for Dirichlet Process Mixture Models
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Mixture models with a prior on the number of components
- Modeling Protein Expression and Protein Signaling Pathways
- Network science. With Márton Pósfai
- Networks. An introduction.
- Optimal predictive model selection.
- Probabilistic Community Detection With Unknown Number of Communities
- Random Partition Models for Microclustering Tasks
- Sparse graphs using exchangeable random measures
- Sparse inverse covariance estimation with the graphical lasso
- Statistical clustering of temporal networks through a dynamic stochastic block model
- The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models
- The Weighted Likelihood Ratio, Linear Hypotheses on Normal Location Parameters
- The dependent Dirichlet process and related models
This page was built for publication: Bayesian learning of graph substructures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122075)
