Fetching the paper…
Reading the bibliography…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them.
Theory of reproducing kernels
N. Aronszajn · 1950
Earlier work this paper cites.
Fourier analysis on groups
W. Rudin · 1962
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir Vapnik and Alexey Chervonenkis · 1971
Earlier work this paper cites.
Fast algorithms for the all nearest neighbors problem
Kenneth L. Clarkson · 1983
Earlier work this paper cites.
Extensions of Lipschitz maps into a Hilbert space
William B. Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Quasi-optimal range searching in spaces of finite VC-dimension
Bernard Chazelle and Emo Welzl · 1989
Earlier work this paper cites.
Inductive principles of the search for emperical dependencies
Vladimir Vapnik · 1989
Earlier work this paper cites.
The fast Gauss transform
Leslie Greengard and John Strain · 1991
Earlier work this paper cites.
Approximations and optimal geometric divide-and-conquer
Jiri Matoušek · 1991
Earlier work this paper cites.
Discrepancy and approximations for bounded VC-dimension
Jiri Matoušek, Emo Welzl, and Lorenz Wernisch · 1993
Earlier work this paper cites.
Efficient distribution-free learning of probabilistic concepts
Michael Kerns and Robert E. Shapire · 1994
Earlier work this paper cites.
Sharper bounds for Gaussian and emperical processes
M. Talagrand · 1994
Earlier work this paper cites.
A decomposition of multidimensional point sets with applicatrions to k k -nearest neighbors and n n -body potential fields
Paul B. Callahan and S. Rao Kosaraju · 1995
Earlier work this paper cites.
Sphere packing numbers for subsets of the boolean n n -cube with bounded Vapnik-Chervonenkis dimension
David Haussler · 1995
Earlier work this paper cites.
Tight upper bounds for the discrepancy of halfspaces
Jiri Matoušek · 1995
Earlier work this paper cites.
Distances Euclidiennes sur les mesures signées et application à des théorèmes de Berry-Esséen
Ch. Suquet · 1995
Earlier work this paper cites.
Fat-shattering and the learnability of real-valued functions
Peter L. Bartlett, Philip M. Long, and Robert C. Williamson · 1996
Cited alongside, same era.
On linear-time deterministic algorithms for optimization problems in fixed dimensions
Bernard Chazelle and Jiri Matousek · 1996
Cited alongside, same era.
A Probabilistic Theory of Pattern Recognition
Luc Devroye, László Györfi, and Gábor Lugosi · 1996
Cited alongside, same era.
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon, Shai Ben-David, Nocolò Cesa-Bianchi, and David Haussler · 1997
Cited alongside, same era.
Geometry of Cuts and Metrics
Michel Marie Deza and Monique Laurent · 1997
Cited alongside, same era.
Integral probability metrics and their generating classes of functions
Alfred Müller · 1997
Cited alongside, same era.
Random features for large-scale kernel machines
Ali Rahimi and Benjamin Recht · 2007
Later among the works it cites.
A Hilbert space embedding for distributions
Alex J. Smola, Arthur Gretton, Le Song, and Bernhard Schölkopf · 2007
Later among the works it cites.
Earth mover distance over high-dimensional spaces
Alexandr Andoni, Piotr Indyk, and Robert Krauthgamer · 2008
Later among the works it cites.
Matching point sets with respect to the earth mover’s distance
Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote · 2008
Later among the works it cites.
Sparse approximation of currents for statistics on curves and surfaces
Stanley Durrleman, Xavier Pennec, Alain Trouvé, and Nicholas Ayache · 2008
Later among the works it cites.
Algorithms for ε \varepsilon -approximations of terrains
Jeff M. Phillips · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Geometric Discrepancy
Jiri Matoušek · 1999
Cited alongside, same era.
The Discrepancy Method
Bernard Chazelle · 2000
Cited alongside, same era.
Improved bounds on the samples complexity of learning
Yi Li, Philip M. Long, and Aravind Srinivasan · 2001
Cited alongside, same era.
Improved fast Gauss transform and efficient kernel density estimation
C. Yang, R. Duraiswami, N.A. Gumerov, and L. Davis · 2003
Cited alongside, same era.
Range counting over multidimensional data streams
Subhash Suri, Csaba D. Tóth, and Yunhong Zhou · 2004
Cited alongside, same era.
Transport par difféomorphismes de points, de mesures et de courants pour la comparaison de formes et l’anatomie numérique
Joan Glaunès · 2005
Cited alongside, same era.
Approximate Earth mover’s distance in linear time
Sameer Shirdhonkar and David W. Jacobs · 2008
Later among the works it cites.
Efficient sketches for Earth-mover distance, with applications
Alexandr Andoni, Khanh Do Ba, Piotr Indyk, and David Woodruff · 2009
Later among the works it cites.
Shape fitting on point sets with probability distributions
Maarten Löffler and Jeff M. Phillips · 2009
Later among the works it cites.
Constructive algorithms for discrepancy minimization
Nikhil Bansal · 2010
Closest in time.
Hilbert space embeddings of hidden markov models
Le Song, Byron Boots, Sajid Siddiqi, Geoffrey Gordon, and Alex J. Smola · 2010
Closest in time.
Hilbert space embeddings and metrics on probability measures
Bharath K. Sriperumbudur, Arthur Gretton, Kenji Fukumizu, Bernhard Schölkopf, and Gert R. G. Lanckriet · 2010
Closest in time.
Tight hardness results for minimizing discrepancy
Moses Charikar, Alantha Newman, and Aleksandar Nikolov · 2011
Closest in time.
Personal communication, 2011
Aleksandar Nikolov · 2011
Closest in time.
A gentle introduction to the kernel distance
Jeff M. Phillips and Suresh Venkatasubramanian · 2011
Closest in time.