transport

MaRDI QIDQ28947swMATHCRANFDO

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

Last update 16 September 2024

Copyright license GNU General Public License, version 2.0, GNU General Public License, version 3.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, PACKAGES.rds, 0.15-0, 0.15-2, 0.15-4

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

(36)

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

This page was built for software: transport