Computer Science – Learning
Scientific paper
2012-03-15
Computer Science
Learning
Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)
Scientific paper
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.
Blundell Charles
Heller Katherine A.
Teh Yee Whye
No associations
LandOfFree
Bayesian Rose Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bayesian Rose Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bayesian Rose Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32072