Hybrid Wasserstein distance and fast distribution clustering (Q2283573)

The Wasserstein distance became one of the most popular and promising tools in machine learning community lately because of its high ability to capture the underlying geometry, possibility to compare the discrete and continuous distributions and shape preservation. The main contribution of this paper is the efficient modification of the Wasserstein distance that can be estimated and computed quickly. The efficiency of a proposed hybrid Wasserstein \(k\)-means clustering methods is illustrated on univariate and multivariate examples.