Published on Thu Sep 22 2011

Probabilistic prototype models for attributed graphs

S. Deepak Srinivasan, Klaus Obermayer

A random attributed graph is defined as an attributed graph whose nodes and edges are annotated by random variables. Every node/edge has two random processes associated with it- occurence probability and the probability distribution over the attribute values. These are estimated within the maximum likelihood framework.

0
0
0
Abstract

This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are annotated by random variables. Every node/edge has two random processes associated with it- occurence probability and the probability distribution over the attribute values. These are estimated within the maximum likelihood framework. The likelihood of a random attributed graph to generate an outcome graph is used as a feature for classification. The proposed approach is fast and robust to noise.

Fri Oct 04 2013
Artificial Intelligence
Labeled Directed Acyclic Graphs: a generalization of context-specific independence in directed graphical models
We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for the conditional probability distribution of a node. We develop a novel prior distribution for the model structures that can appropriately penalize a
0
0
0
Thu Jun 23 2016
Artificial Intelligence
A review of Gaussian Markov models for conditional independence
Markov models lie at the interface between statistical independence in a probability distribution and graph separation properties. We review model selection and estimation in directed and undirected Markov models with Gaussian parametrization.
0
0
0
Tue Oct 24 2017
Machine Learning
Markov Properties for Graphical Models with Cycles and Latent Variables
We investigate probabilistic graphical models that allow for both cycles and latent variables. We show how the Markov properties for HEDGes and corresponding Markov models are logically related to each other.
0
0
0
Mon Jul 25 2011
Artificial Intelligence
Lifted Graphical Models: A Survey
This article presents a survey of work on lifted graphical models. It is our belief that the need for statistical relational models will grow in the coming decades. We hope that this synthesis of ideas from many different research groups will provide an accessible starting point for new researchers.
0
0
0
Fri May 28 2021
Machine Learning
Inferring community characteristics in labelled networks
Labelled networks form a very common and important class of data, naturally appearing in numerous applications in science and engineering. A standard approach has been to partition the network into blocks grouped by distinct values of the feature of interest. In this work, we introduce a new Generative model, the feature-first block model (FFBM), which is more effective.
1
0
14
Wed Jan 30 2013
Artificial Intelligence
Approximate Counting of Graphical Models Via MCMC Revisited
In Pe\~na (2007), MCMC sampling is applied to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20nodes. In the present paper, we extend that work from 20 to 31 nodes.
0
0
0