Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models

DOI10.1109/TSP.2012.2214216MaRDI QIDQ4574188zbMATH OpenFDO

Authors Divyanshu Vats, José M. F. Moura

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.4067

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability distributions. In general, this is computationally intractable, which has led to a quest for finding efficient approximate inference algorithms. We propose a framework for generalized inference over graphical models that can be used as a wrapper for improving the estimates of approximate inference algorithms. Instead of applying an inference algorithm to the original graph, we apply the inference algorithm to a block-graph, defined as a graph in which the nodes are non-overlapping clusters of nodes from the original graph. This results in marginal estimates of a cluster of nodes, which we further marginalize to get the marginal estimates of each node. Our proposed block-graph construction algorithm is simple, efficient, and motivated by the observation that approximate inference is more accurate on graphs with longer cycles. We present extensive numerical simulations that illustrate our block-graph framework with a variety of inference algorithms (e.g., those in the libDAI software package). These simulations show the improvements provided by our framework.

Recommendations

• High-dimensional inference for cluster-based graphical models
• Identifying graph clusters using variational inference and links to covariance parametrization
• Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
• Graph-Based Data Clustering with Overlaps
• Graph-based data clustering with overlaps
• Efficient, certifiably optimal clustering with applications to latent variable graphical models
• Bayesian inference of clustering and multiple Gaussian graphical models selection
• Bayesian clustering in decomposable graphs
• Non-parametric overlapping community detection

Cited in

(2)

• Identifying graph clusters using variational inference and links to covariance parametrization
• Simultaneous Clustering and Estimation of Heterogeneous Graphical Models

This page was built for publication: Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574188)