Beyond Conjugacy for Chain Event Graph Model Selection

• URL: http://arxiv.org/abs/2211.03427v1
• Date: Mon, 7 Nov 2022 10:33:01 GMT
• Title: Beyond Conjugacy for Chain Event Graph Model Selection
• Authors: Aditi Shenvi, Silvia Liverani
• Abstract summary: Chain event graphs are a family of probabilistic graphical models that generalise Bayesian networks. We propose a mixture modelling approach to model selection in chain event graphs that does not rely on conjugacy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Chain event graphs are a family of probabilistic graphical models that generalise Bayesian networks and have been successfully applied to a wide range of domains. Unlike Bayesian networks, these models can encode context-specific conditional independencies as well as asymmetric developments within the evolution of a process. More recently, new model classes belonging to the chain event graph family have been developed for modelling time-to-event data to study the temporal dynamics of a process. However, existing model selection algorithms for chain event graphs and its variants rely on all parameters having conjugate priors. This is unrealistic for many real-world applications. In this paper, we propose a mixture modelling approach to model selection in chain event graphs that does not rely on conjugacy. Moreover, we also show that this methodology is more amenable to being robustly scaled than the existing model selection algorithms used for this family. We demonstrate our techniques on simulated datasets.

Related papers

• Hierarchical Blockmodelling for Knowledge Graphs [0.5530212768657544]
  We use blockmodels for the purpose of hierarchical entity clustering on knowledge graphs. The integration of the Nested Chinese Restaurant Process and the Stick Breaking Process into the generative model allows for the induction of hierarchical clusterings. We evaluate our model on synthetic and real-world datasets and quantitatively compare against benchmark models.
  arXiv  Detail & Related papers  (2024-08-28T09:04:15Z)
• IFH: a Diffusion Framework for Flexible Design of Graph Generative Models [53.219279193440734]
  Graph generative models can be classified into two prominent families: one-shot models, which generate a graph in one go, and sequential models, which generate a graph by successive additions of nodes and edges. This paper proposes a graph generative model, called Insert-Fill-Halt (IFH), that supports the specification of a sequentiality degree.
  arXiv  Detail & Related papers  (2024-08-23T16:24:40Z)
• Heterogeneous Graph Learning for Acoustic Event Classification [22.526665796655205]
  Graphs for audiovisual data are constructed manually which is difficult and sub-optimal. We develop a new model, heterogeneous graph crossmodal network (HGCN) that learns the crossmodal edges. Our proposed model can adapt to various spatial and temporal scales owing to its parametric construction, while the learnable crossmodal edges effectively connect the relevant nodes.
  arXiv  Detail & Related papers  (2023-03-05T13:06:53Z)
• Creating generalizable downstream graph models with random projections [22.690120515637854]
  We investigate graph representation learning approaches that enable models to generalize across graphs. We show that using random projections to estimate multiple powers of the transition matrix allows us to build a set of isomorphism-invariant features. The resulting features can be used to recover enough information about the local neighborhood of a node to enable inference with relevance competitive to other approaches.
  arXiv  Detail & Related papers  (2023-02-17T14:27:00Z)
• GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
  We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton. The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases. In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
  arXiv  Detail & Related papers  (2022-12-01T11:49:07Z)
• Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training [82.68805025636165]
  We propose to select positive graph instances directly from existing graphs in the training set. Our selection is based on certain domain-specific pair-wise similarity measurements. Besides, we develop an adaptive node-level pre-training method to dynamically mask nodes to distribute them evenly in the graph.
  arXiv  Detail & Related papers  (2022-06-23T20:12:51Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• A Study of Joint Graph Inference and Forecasting [13.340967777671565]
  We study a recent class of models which uses graph neural networks (GNNs) to improve forecasting in multivariate time series. By parameterizing a graph in a differentiable way, the models aim to improve forecasting quality.
  arXiv  Detail & Related papers  (2021-09-10T16:34:35Z)
• T-LoHo: A Bayesian Regularization Model for Structured Sparsity and Smoothness on Graphs [0.0]
  In graph-structured data, structured sparsity and smoothness tend to cluster together. We propose a new prior for high dimensional parameters with graphical relations. We use it to detect structured sparsity and smoothness simultaneously.
  arXiv  Detail & Related papers  (2021-07-06T10:10:03Z)
• Hawkes Processes on Graphons [85.6759041284472]
  We study Hawkes processes and their variants that are associated with Granger causality graphs. We can generate the corresponding Hawkes processes and simulate event sequences. We learn the proposed model by minimizing the hierarchical optimal transport distance between the generated event sequences and the observed ones.
  arXiv  Detail & Related papers  (2021-02-04T17:09:50Z)
• Permutation Invariant Graph Generation via Score-Based Generative Modeling [114.12935776726606]
  We propose a permutation invariant approach to modeling graphs, using the recent framework of score-based generative modeling. In particular, we design a permutation equivariant, multi-channel graph neural network to model the gradient of the data distribution at the input graph. For graph generation, we find that our learning approach achieves better or comparable results to existing models on benchmark datasets.
  arXiv  Detail & Related papers  (2020-03-02T03:06:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.