In mathematics, the Wasserstein or Kantorovich–Rubinstein metric or distance is a distance function defined between probability distributions on a given metric space M {\displaystyle M} M.
Intuitively, if each distribution is viewed as a unit amount of "dirt" piled on M {\displaystyle M} M, the metric is the minimum "cost" of turning one pile into the other, which is assumed to be the amount of dirt that needs to be moved times the mean distance it has to be moved. Because of this analogy, the metric is known in computer science as the earth mover's distance.
Die gezeigten Posts sind eventuell nicht akkurat bei Änderungen, die vor Kurzem vorgenommen worden. Wollen Sie jedoch akkurate Posts mit eingeschränkten Sortierungsmöglichkeiten, folgen Sie dem folgenden Link.
S. Basu, A. Banerjee, und R. Mooney. Proceedings of the 2004 SIAM International Conference on Data Mining, Seite 333--344. Lake Buena Vista, FL, Society for Industrial and Applied Mathematics, (April 2004)
C. Baziotis, N. Pelekis, und C. Doulkeridis. Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval-2017), Seite 390-395. Association for Computational Linguistics, (2017)