当前位置: X-MOL 学术Stat. Probab. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Hierarchical clustering with optimal transport
Statistics & Probability Letters ( IF 0.8 ) Pub Date : 2020-08-01 , DOI: 10.1016/j.spl.2020.108781
Saptarshi Chakraborty , Debolina Paul , Swagatam Das

Abstract Optimal Transport (OT) distances result in a powerful technique to compare the probability distributions. Defining a similarity measure between clusters has been an open problem in Statistics. This paper introduces a hierarchical clustering algorithm using the OT based distance measures and analyzes the performance of the proposed algorithm on standard datasets with respect to the existing and popular hierarchical clustering methods.

中文翻译:

具有最优传输的分层聚类

摘要 最佳传输 (OT) 距离是一种比较概率分布的强大技术。定义聚类之间的相似性度量一直是统计学中的一个悬而未决的问题。本文介绍了一种使用基于 OT 的距离度量的层次聚类算法,并分析了所提出的算法在标准数据集上相对于现有和流行的层次聚类方法的性能。
更新日期:2020-08-01
down
wechat
bug