贝叶斯玫瑰树

Mar, 2012

Bayesian Rose Trees

Charles Blundell, Yee Whye Teh, Katherine A. Heller

TL;DR本文探讨一种基于贝叶斯方法的层次聚类算法，它能够在每个结点上产生任意分支结构的玫瑰树，并通过一种计算有效的贪心凝聚算法来找到具有高边际似然值的玫瑰树，最终实验证明，玫瑰树是数据的较好模型。

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