#### Filter Results:

#### Publication Year

2011

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A Bayesian approach to partitioning distance matrices is presented. It is inspired by the Translation-invariant Wishart-Dirichlet process (TIWD) in [1] and shares a number of advantageous properties like the fully probabilistic nature of the inference model, automatic selection of the number of clusters and applicability in semi-supervised settings. In… (More)

A fully probabilistic approach to reconstructing Gaussian graphical models from distance data is presented. The main idea is to extend the usual central Wishart model in traditional methods to using a likelihood depending only on pairwise distances, thus being independent of geometric assumptions about the underlying Euclidean space. This extension has two… (More)

Molecular classification of hepatocellular carcinomas (HCC) could guide patient stratification for personalized therapies targeting subclass-specific cancer 'driver pathways'. Currently, there are several transcriptome-based molecular classifications of HCC with different subclass numbers, ranging from two to six. They were established using resected… (More)

This paper considers a Bayesian view for estimating a sub-network in a Markov random field. The sub-network corresponds to the Markov blanket of a set of query variables, where the set of potential neighbours here is big. We factorize the posterior such that the Markov blanket is conditionally independent of the network of the potential neighbours. By… (More)

We present an inference method for Gaussian graphical models when only pair-wise distances of n objects are observed. Formally, this is a problem of estimating an n × n covariance matrix from the Mahalanobis distances d MH (x i , x j), where object x i lives in a latent feature space. We solve the problem in fully Bayesian fashion by integrating over the… (More)

- ‹
- 1
- ›