Fetching the paper…
Reading the bibliography…
Optimal transportation distances are a fundamental family of parameterized distances for histograms.
Information theory and statistical mechanics
Jaynes, E. T. (1957) · 1957
Earlier work this paper cites.
Maximum entropy for hypothesis formulation, especially for multidimensional contingency tables
Good, I. (1963) · 1963
Earlier work this paper cites.
Concerning nonnegative matrices and doubly stochastic matrices
Sinkhorn, R. and Knopp, P. (1967) · 1967
Earlier work this paper cites.
On the extreme rays of the metric cone
Avis, D. (1980) · 1980
Earlier work this paper cites.
Harmonic Analysis on Semigroups
Berg, C., Christensen, J., and Ressel, P. (1984) · 1984
Earlier work this paper cites.
The gravity model in transportation analysis: theory and extensions
Erlander, S. and Stewart, N. (1990) · 1990
Earlier work this paper cites.
Elements of Information Theory
Cover, T. and Thomas, J. (1991) · 1991
Earlier work this paper cites.
Network Flows: Theory, Algorithms and Applications
Ahuja, R., Magnanti, T., and Orlin, J. (1993) · 1993
Earlier work this paper cites.
A faster strongly polynomial minimum cost flow algorithm
Orlin, J. B. (1993) · 1993
Earlier work this paper cites.
The earth mover’s distance, multi-dimensional scaling, and color-based image retrieval
Rubner, Y., Guibas, L., and Tomasi, C. (1997) · 1997
Earlier work this paper cites.
The earth mover’s distance is the mallows distance: some insights from statistics
Levina, E. and Bickel, P. (2001) · 2001
Cited alongside, same era.
Fast image retrieval via embeddings
Indyk, P. and Thaper, N. (2003) · 2003
Cited alongside, same era.
Topics in Optimal Transportation
Villani, C. (2003) · 2003
Cited alongside, same era.
Fast contour matching using approximate earth mover’s distance
Grauman, K. and Darrell, T. (2004) · 2004
Cited alongside, same era.
Sampling uniformly from the unit simplex
Smith, N. A. and Tromble, R. W. (2004) · 2004
Cited alongside, same era.
Convex optimization & Euclidean distance geometry
Dattorro, J. (2005) · 2005
Cited alongside, same era.
Combinatorial matrix classes
An efficient earth mover’s distance algorithm for robust histogram comparison
Ling, H. and Okada, K. (2007) · 2007
Later among the works it cites.
Planar earthmover is not in l
Naor, A. and Schechtman, G. (2007) · 2007
Later among the works it cites.
The metric nearness problem
Brickell, J., Dhillon, I., Sra, S., and Tropp, J. (2008) · 2008
Later among the works it cites.
The sinkhorn-knopp algorithm: convergence and applications
Knight, P. A. (2008) · 2008
Later among the works it cites.
Approximate earth mover’s distance in linear time
Shirdhonkar, S. and Jacobs, D. (2008) · 2008
Later among the works it cites.
Efficient sketches for earth-mover distance, with applications
Andoni, A., Ba, K. D., Indyk, P., and Woodruff, D. (2009) · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Brualdi, R. A. (2006) · 2006
Cited alongside, same era.
Maximum entropy distribution estimation with generalized regularization
Dudík, M. and Schapire, R. E. (2006) · 2006
Cited alongside, same era.
Small manhattan networks and algorithmic applications for the earth mover’s distance
Gudmundsson, J., Klein, O., Knauer, C., and Smid, M. (2007) · 2007
Cited alongside, same era.
Fast and robust earth mover’s distances
Pele, O. and Werman, M. (2009) · 2009
Later among the works it cites.
Optimal transport: old and new
Villani, C. (2009) · 2009
Later among the works it cites.
Regularized discrete optimal transport
Ferradans, S., Papadakis, N., Rabin, J., Peyré, G., Aujol, J.-F., et al. (2013) · 2013
Closest in time.