Earth Movers Distance vs Optimal TransportĮarth movers distance differs from optimal transport in that optimal transport disallows splitting and summing of the transported amount at each point. There are papers on approximating EMD with quadratic complexity in general case and linear complexity in document search if pre-computation is allowed.
#EARTH MOVER DISTANCE HOW TO#
How to transform the this geographical distribution of gold ore to this geographical distribution for the least hauling cost?Įarth mover distance computational complexity is super-cubic as can be found in Network Flows: Theory, Algorithms, and Applications. So the problem above can be restated into following question. Good example of transportation problem is cost optimization of transportation of gold ore from mines to refineries, where each refinery can accept only certain percentage of the ore.Įarth Movers Distance is also a distance metric between probability distributions. It is minimum amount of dirt multiplied by distance needed to transform one pile of dirt into another pile of dirt.ĭespite the earth in the name, better analogy is that of a transportation problem. How WMD works? Why is it so good? Is there any low complexity approximation of WMD? What is Earth Mover’s Distance? However, vanilla WMD has cubic computational complexity, which makes it impractical in many applications. Word Mover’s Distance captures the semantic similarity between documents more accurately than the cosine similarity between word vector averages. Watch Word Mover's Embedding: Cheap WMD For Documents on Youtube
0 kommentar(er)
