Fetching the paper…
Reading the bibliography…
We initiate the rigorous study of classification in semimetric spaces, which are point sets with a distance function that is non-negative and symmetric, but need not satisfy the triangle inequality.
Wallace Alvin Wilson · 1931
Earlier work this paper cites.
Cauchy sequences in semimetric spaces
Dennis K. Burke · 1972
Earlier work this paper cites.
A linear-time approximation algorithm for the weighted vertex cover problem
Reuven Bar-Yehuda and Shimon Even · 1981
Earlier work this paper cites.
Relating data compression and learnability, unpublished
Nick Littlestone and Manfred K. Warmuth · 1986
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth · 1989
Earlier work this paper cites.
A general lower bound on the number of examples needed for learning
Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant · 1989
Earlier work this paper cites.
Comparing images using the hausdorff distance
D.P. Huttenlocher, G.A. Klanderman, and W.J. Rucklidge · 1993
Earlier work this paper cites.
A modified hausdorff distance for object matching
Marie-Pierre Dubuisson and Anil K. Jain · 1994
Earlier work this paper cites.
Determining the similarity of deformable shapes
R. Basri, L. Costa, D. Geiger, and D. Jacobs · 1995
Earlier work this paper cites.
Pichunter: Bayesian relevance feedback for image retrieval
Ingemar J. Cox, M.L. Miller, S.M. Omohundro, and P.N. Yianilos · 1996
Earlier work this paper cites.
A probabilistic theory of pattern recognition , volume 31 of Applications of Mathematics (New York)
Luc Devroye, László Györfi, and Gábor Lugosi · 1996
Earlier work this paper cites.
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, and David Haussler · 1997
Earlier work this paper cites.
Representation and recognition of handwritten digits using deformable templates
Anil K. Jain and Douglas Zongker · 1997
Earlier work this paper cites.
Condensing image databases when retrieval is based on non-metric distances
David W. Jacobs, Daphna Weinshall, and Yoram Gdalyahu · 1998
Earlier work this paper cites.
Classification in non-metric spaces
Daphna Weinshall, David W. Jacobs, and Yoram Gdalyahu · 1998
Earlier work this paper cites.
Flexible syntactic matching of curves and its application to automatic hierarchical classification of silhouettes
Y. Gdalyahu and D. Weinshall · 1999
Cited alongside, same era.
Empirical evaluation of dissimilarity measures for color and texture
J. Puzicha, J.M. Buhmann, Y. Rubner, and C. Tomasi · 1999
Cited alongside, same era.
Classification with nonmetric distances: Image retrieval and class representation
David W. Jacobs, Daphna Weinshall, and Yoram Gdalyahu · 2000
Cited alongside, same era.
The earth mover’s distance as a metric for image retrieval
Yossi Rubner, Carlo Tomasi, and Leonidas J. Guibas · 2000
Cited alongside, same era.
Jensen-shannon divergence and hilbert space embedding
Bend Fuglede and Flemming Topsøe · 2004
Cited alongside, same era.
Navigating nets: Simple algorithms for proximity search
Robert Krauthgamer and James R. Lee · 2004
On learning with dissimilarity functions
Liwei Wang, Cheng Yang, and Jufu Feng · 2007
Later among the works it cites.
Improved guarantees for learning via similarity functions
Maria-Florina Balcan, Avrim Blum, and Nathan Srebro · 2008
Later among the works it cites.
A discriminative framework for clustering via similarity functions
Maria-Florina Balcan, Avrim Blum, and Santosh Vempala · 2008
Later among the works it cites.
Hierarchical sampling for active learning
Sanjoy Dasgupta and Daniel Hsu · 2008
Later among the works it cites.
The computational hardness of estimating edit distance
Alexandr Andoni and Robert Krauthgamer · 2010
Later among the works it cites.
Efficient classification for metric data
Lee-Ad Gottlieb, Leonid Kontorovich, and Robert Krauthgamer · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Maximum matchings via gaussian elimination
Marcin Mucha and Piotr Sankowski · 2004
Cited alongside, same era.
Distance-based classification with Lipschitz functions
Ulrike von Luxburg and Olivier Bousquet · 2004
Cited alongside, same era.
Theory of classification: a survey of some recent advances
Stéphane Boucheron, Olivier Bousquet, and Gábor Lugosi · 2005
Cited alongside, same era.
Pac-bayesian compression bounds on the prediction error of learning algorithms for classification
Thore Graepel, Ralf Herbrich, and John Shawe-Taylor · 2005
Cited alongside, same era.
On a theory of learning with similarity functions
Maria-Florina Balcan and Avrim Blum · 2006
Cited alongside, same era.
Cover trees for nearest neighbor
Alina Beygelzimer, Sham Kakade, and John Langford · 2006
Cited alongside, same era.
Foundations Of Machine Learning
Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar · 2012
Later among the works it cites.
Breaking the Coppersmith-Winograd barrier
Virginia Vassilevska Williams · 2012
Later among the works it cites.
Proximity algorithms for nearly doubling spaces
Lee-Ad Gottlieb and Robert Krauthgamer · 2013
Later among the works it cites.
Generative adversarial nets
Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C. Courville, and Yoshua Bengio · 2014
Later among the works it cites.
Efficient classification for metric data
Lee-Ad Gottlieb, Aryeh Kontorovich, and Robert Krauthgamer · 2014
Later among the works it cites.
Near-optimal sample compression for nearest neighbors
Lee-Ad Gottlieb, Aryeh Kontorovich, and Pinhas Nisnevitch · 2014
Later among the works it cites.
Maximum margin multiclass nearest neighbors
Aryeh Kontorovich and Roi Weiss · 2014
Later among the works it cites.
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Later among the works it cites.