DeepAI AI Chat
Log In Sign Up

Pitman-Yor Diffusion Trees

by   David A. Knowles, et al.

We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clustering, a generalization of the Dirichlet Diffusion Tree (Neal, 2001) which removes the restriction to binary branching structure. The generative process is described and shown to result in an exchangeable distribution over data points. We prove some theoretical properties of the model and then present two inference methods: a collapsed MCMC sampler which allows us to model uncertainty over tree structures, and a computationally efficient greedy Bayesian EM search algorithm. Both algorithms use message passing on the tree structure. The utility of the model and algorithms is demonstrated on synthetic and real world data, both continuous and binary.


page 1

page 2

page 3

page 4


Bayesian Rose Trees

Hierarchical structure is ubiquitous in data across many domains. There ...

Continuous-Time Birth-Death MCMC for Bayesian Regression Tree Models

Decision trees are flexible models that are well suited for many statist...

Detecting Jumps on a Tree: a Hierarchical Pitman-Yor Model for Evolution of Phenotypic Distributions

This work focuses on clustering populations with a hierarchical dependen...

Minimum Error Tree Decomposition

This paper describes a generalization of previous methods for constructi...

Bayesian inference of species trees using diffusion models

We describe a new and computationally efficient Bayesian methodology for...

HyperAid: Denoising in hyperbolic spaces for tree-fitting and hierarchical clustering

The problem of fitting distances by tree-metrics has received significan...

Coarse Graining of Data via Inhomogeneous Diffusion Condensation

Big data often has emergent structure that exists at multiple levels of ...