Identifying graph clusters using variational inference and links to covariance parametrization
DOI10.1098/RSTA.2009.0117zbMATH Open1185.05144OpenAlexW2110023275WikidataQ51787295 ScholiaQ51787295MaRDI QIDQ3559953FDOQ3559953
Authors: David Barber
Publication date: 8 May 2010
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rsta.2009.0117
Recommendations
- Variational Bayesian inference for the latent position cluster model for network data
- Variational perspective on local graph clustering
- High-dimensional inference for cluster-based graphical models
- Efficient, certifiably optimal clustering with applications to latent variable graphical models
- Latent structure blockmodels for Bayesian spectral graph clustering
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models
- A variational inference procedure allowing internal structure for overlapping clusters and deterministic constraints
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Graphical methods in statistics (62A09) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Internet topics (68M11)
Cites Work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- The Structure and Function of Complex Networks
- Gaussian Markov distributions over finite graphs
- Schur products and matrix completions
- Estimation of a covariance matrix with zeros
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Maximum-likelihood estimation of the parameters of a multivariate normal distribution
Cited In (5)
- Simultaneous Cluster Structure Learning and Estimation of Heterogeneous Graphs for Matrix-Variate fMRI Data
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models
- Uncovering latent structure in valued graphs: a variational approach
This page was built for publication: Identifying graph clusters using variational inference and links to covariance parametrization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559953)