最优区间聚类:应用于Bregman聚类和统计混合学习
Optimal interval clustering: Application to Bregman clustering and statistical mixture learning
摘要:
我们提出了一个通用的动态规划方法来计算$n$标量元素到$k$成对不相交区间的最佳聚类。这种情况下,包括一维欧几里德$k$ -手段,$k$ -medoids,$k$ -中位数,$k$ -中心等,我们扩展的方法,将集群大小的限制,并显示如何选择合适的$k$模型选择。最后,我们在两个案例研究中说明和改进了该方法:Bregman聚类和统计混合学习最大化完整的可能性。
英文摘要:
We present a generic dynamic programming method to compute the optimal clustering of $n$ scalar elements into $k$ pairwise disjoint intervals. This case includes 1D Euclidean $k$-means, $k$-medoids, $k$-medians, $k$-centers, etc. We extend the method to incorporate cluster size constraints and show how to choose the appropriate $k$ by model selection. Finally, we illustrate and refine the method on two case studies: Bregman clustering and statistical mixture learning maximizing the complete likelihood.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。