Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Statistics/Statistics Field/Probability theory/Probability/Probability Distribution/Frequency Distribution/
EMD
Search

EMD

Creator
Creator
Seonglae Cho
Created
Created
2025 Mar 9 23:53
Editor
Editor
Seonglae Cho
Edited
Edited
2025 Mar 10 0:46
Refs
Refs
KL Divergence
Combinatorial Optimization

Earth mover's distance, Optimal Transport Problem

The minimum cost required to transform one probability distribution into another by moving probability mass, where cost is defined as the total distance that mass needs to be moved
It does not diverges even if
Support
does not duplicate.
Probability Density Function
where

Flow

 
 

Algorithm

  • Hungarian Matching
 
 
 
Earth mover's distance
In computer science, the earth mover's distance (EMD)[1] is a measure of dissimilarity between two frequency distributions, densities, or measures, over a metric space D. Informally, if the distributions are interpreted as two different ways of piling up earth (dirt) over D, the EMD captures the minimum cost of building the smaller pile using dirt taken from the larger, where cost is defined as the amount of dirt moved multiplied by the distance over which it is moved.
Earth mover's distance
https://en.wikipedia.org/wiki/Earth_mover%27s_distance
 
 

Table of Contents
Earth mover's distance, Optimal Transport ProblemFlowAlgorithm

Recommendations

Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Statistics/Statistics Field/Probability theory/Probability/Probability Distribution/Frequency Distribution/
EMD
Copyright Seonglae Cho