Hierarchical clustering with optimal transport

DOI10.1016/j.spl.2020.108781zbMath1456.62117OpenAlexW3017034984MaRDI QIDQ2006729

Debolina Paul, Swagatam Das, Saptarshi Chakraborty

Publication date: 12 October 2020

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2020.108781

zbMATH Keywords

clusteringhierarchical clusteringoptimal transportSinkhorn distance

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics in engineering and industry; control charts (62P30) Transportation, logistics and supply chain management (90B06)

Related Items (3)

Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm ⋮ Biconvex Clustering ⋮ Strategic oscillation for the balanced minimum sum-of-squares clustering problem

Uses Software

• UCI-ml
• CRAN
• JStatCom
• KEEL
• mlbench
• sparcl
• Wasserstein GAN

Cites Work

• Unnamed Item
• Unnamed Item
• Influential features PCA for high dimensional clustering
• Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms
• Agglomerative clustering via maximum incremental path integral
• Consistent selection of the number of clusters via crossvalidation
• An efficient algorithm for a complete link method
• A Framework for Feature Selection in Clustering
• Sur la liaison et la division des points d'un ensemble fini

This page was built for publication: Hierarchical clustering with optimal transport