transport

MaRDI QIDQ28947swMATHCRANFDO

Authors Nicolas Bonneel, Björn Bähre, Bernhard Schmitzer, Florian Heinemann, Valentin Hartmann, Dominic Schuhmacher, Jörn Schrieber, Carsten Gottschlich

Last update 18 February 2024

Copyright license GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier 0.13-0, 0.14-1, 0.6-1, 0.6-2, 0.6-3, 0.7-0, 0.7-3, 0.8-1, 0.8-2, 0.9-3, 0.9-4, 0.10-0, 0.11-0, 0.11-1, 0.11-2, 0.12-0, 0.12-1, 0.12-2, 0.12-4, 0.14-4, 0.14-6, 0.14-7

Official website https://cran.r-project.org/web/packages/transport/index.html

Source code repository https://github.com/cran/transport

Description

Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet–Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.

Cited in

(29)

• Rcplex
• DOTmark
• gk
• tailDepFun
• RecordLinkage
• maxlinearCRPS
• libLBFGS
• Barycenter
• ttbary
• Ecume
• cylcop
• StratifiedSampling
• LOMAR
• WSGeometry
• drf
• kanjistat
• GMPro
• otinference
• Optimal transport: fast probabilistic approximation with exact solvers
• \(k\)-means clustering of extremes
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
• epiphy
• SBCK
• CytoBackBone
• CyTOFmerge
• Statistical file-matching of non-Gaussian data: a game theoretic approach
• Gaussian processes with multidimensional distribution inputs via optimal transport and Hilbertian embedding
• Identifiability and consistent estimation of nonparametric translation hidden Markov models with general state space
• Multivariate goodness-of-fit tests based on Wasserstein distance

This page was built for software: transport