0


基于示例的集群的灵活先验

Flexible Priors for Exemplar-based Clustering
课程网址: http://videolectures.net/uai08_tarlow_fp/  
主讲教师: Daniel Tarlow
开课单位: 多伦多大学
开课时间: 2008-07-30
课程语种: 英语
中文简介:
基于示例的聚类方法已显示出可对许多综合和现实聚类问题产生最新的结果。它们之所以具有吸引力,是因为它们比潜在均值模型具有计算优势,并且可以处理数据点之间的任意成对相似性度量。但是,当试图在聚类问题中恢复底层结构时,通常仅采用量身定制的相似性度量是不够的。我们还希望控制群集大小的分布。诸如Dirichlet过程优先级之类的优先级允许在通过数据分区表达优先级时,不指定群集的数量。据我们所知,它们尚未应用于基于示例的模型。我们展示了如何将包括Dirichlet过程先验在内的先验合并到最近引入的亲和力传播算法中。我们为新模型开发了有效的最大乘积置信传播算法,并通过实验演示了  聚类先验的扩展范围使我们能够在有一些有关生成过程的信息的情况下更好地恢复真实的聚类。
课程简介: Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they offer computational benefits over latent-mean models and can handle arbitrary pairwise similarity measures between data points. However, when trying to recover underlying structure in clustering problems, tailored similarity measures are often not enough; we also desire control over the distribution of cluster sizes. Priors such as Dirichlet process priors allow the number of clusters to be unspecified while expressing priors over data partitions. To our knowledge, they have not been applied to exemplar-based models. We show how to incorporate priors, including Dirichlet process priors, into the recently introduced affinity propagation algorithm. We develop an efficient max product belief propagation algorithm for our new model and demonstrate experimentally how the expanded range of clustering priors allows us to better recover true clusterings in situations where we have some information about the generating process.
关 键 词: 聚类方法; 潜在均值模型; 群集
课程来源: 视频讲座网
最后编审: 2019-10-04:cjy
阅读次数: 32