Bayesian Rose Trees

Abstract

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.

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

References in corpus (1)

• Bayesian Agglomerative Clustering with Coalescents

Cited by in corpus (10)

• Online Visual Analytics of Text Streams
• Interactive Steering of Hierarchical Clustering
• Extracting Hierarchies of Search Tasks & Subtasks via a Bayesian Nonparametric Approach
• Multiresolution Gaussian Processes
• Agglomerative Bregman Clustering
• Pitman-Yor Diffusion Trees
• A representation of exchangeable hierarchies by sampling from real trees
• Evaluating the Complementarity of Taxonomic Relation Extraction Methods Across Different Languages
• Exact and Approximate Hierarchical Clustering Using A*
• Learning Hierarchical Item Categories from Implicit Feedback Data for Efficient Recommendations and Browsing