DeepAI AI Chat
Log In Sign Up

Bayesian Rose Trees

by   Charles Blundell, et al.

Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while computationally convenient, is often undesirable. In this paper we explore a Bayesian hierarchical clustering algorithm that can produce trees with arbitrary branching structure at each node, known as rose trees. We interpret these trees as mixtures over partitions of a data set, and use a computationally efficient, greedy agglomerative algorithm to find the rose trees which have high marginal likelihood given the data. Lastly, we perform experiments which demonstrate that rose trees are better models of data than the typical binary trees returned by other hierarchical clustering algorithms.


Learning Binary Trees via Sparse Relaxation

One of the most classical problems in machine learning is how to learn b...

Pitman-Yor Diffusion Trees

We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clust...

Bayesian contiguity constrained clustering, spanning trees and dendrograms

Clustering is a well-known and studied problem, one of its variants, cal...

Anytime Hierarchical Clustering

We propose a new anytime hierarchical clustering method that iteratively...

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles

When analysing binary data, the ease at which one can interpret results ...

Clustering with minimum spanning trees: How good can it be?

Minimum spanning trees (MSTs) provide a convenient representation of dat...

Flattening Multiparameter Hierarchical Clustering Functors

We bring together topological data analysis, applied category theory, an...