Article

On Approximate Nearest Neighbors in Non-Euclidean Spaces

Author:

P. IndykAuthors Info & Claims

FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Page 148

Published: 08 November 1998 Publication History

Publisher Site

Abstract

No abstract available.

Cited By

View all

Andoni ANikolov ARazenshteyn IWaingarten EMarx D(2021)Approximate nearest neighbors beyond space partitionsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458136(1171-1190)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458136
Sra SCherian A(2011)Generalized dictionary learning for symmetric positive definite matrices with application to nearest neighbor retrievalProceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III10.5555/2034161.2034183(318-332)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.5555/2034161.2034183
Sra SCherian A(2011)Generalized Dictionary Learning for symmetric positive definite matrices with application to Nearest Neighbor retrievalProceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part III10.1007/978-3-642-23808-6_21(318-332)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.1007/978-3-642-23808-6_21
Show More Cited By

Index Terms

On Approximate Nearest Neighbors in Non-Euclidean Spaces
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching

Index terms have been assigned to the content through auto-classification.

Recommendations

On Approximate Nearest Neighbors under l∞ Norm

The nearest neighbor search (NNS) problem is the following: Given a set of n points P={p1, , pn} in some metric space X, preprocess P so as to efficiently answer queries which require finding a point in P closest to a query point q X. The approximate ...
Hausdorff distance with k-nearest neighbors
ICSI'12: Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II

Hausdorff distance (HD) is an useful measurement to determine the extent to which one shape is similar to another, which is one of the most important problems in pattern recognition, computer vision and image analysis. Howeverm, HD is sensitive to ...
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition

Many pattern recognition tasks make use of the k nearest neighbour (k-NN) technique. In this paper we are interested on fast k- NN search algorithms that can work in any metric space i.e. they are not restricted to Euclidean-like distance functions. ...

Comments

Information & Contributors

Information

Published In

FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science

November 1998

ISBN:0818691727

Publisher

IEEE Computer Society

United States

Publication History

Published: 08 November 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Andoni ANikolov ARazenshteyn IWaingarten EMarx D(2021)Approximate nearest neighbors beyond space partitionsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458136(1171-1190)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458136
Sra SCherian A(2011)Generalized dictionary learning for symmetric positive definite matrices with application to nearest neighbor retrievalProceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III10.5555/2034161.2034183(318-332)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.5555/2034161.2034183
Sra SCherian A(2011)Generalized Dictionary Learning for symmetric positive definite matrices with application to Nearest Neighbor retrievalProceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part III10.1007/978-3-642-23808-6_21(318-332)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.1007/978-3-642-23808-6_21
Ailon NChazelle B(2010)Faster dimension reductionCommunications of the ACM10.1145/1646353.164637953:2(97-104)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1145/1646353.1646379
Ailon NLiberty ETeng S(2008)Fast dimension reduction using Rademacher series on dual BCH codesProceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/1347082.1347083(1-9)Online publication date: 20-Jan-2008
https://dl.acm.org/doi/10.5555/1347082.1347083
Xu LLuo BSebe NWorring M(2007)Appearance-based video clustering in 2D locality preserving projection subspaceProceedings of the 6th ACM international conference on Image and video retrieval10.1145/1282280.1282333(356-362)Online publication date: 9-Jul-2007
https://dl.acm.org/doi/10.1145/1282280.1282333
Indyk PNaor A(2007)Nearest-neighbor-preserving embeddingsACM Transactions on Algorithms10.1145/1273340.12733473:3(31-es)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1145/1273340.1273347
Ailon NChazelle BKleinberg J(2006)Approximate nearest neighbors and the fast Johnson-Lindenstrauss transformProceedings of the thirty-eighth annual ACM symposium on Theory of Computing10.1145/1132516.1132597(557-563)Online publication date: 21-May-2006
https://dl.acm.org/doi/10.1145/1132516.1132597
Wang HPei JYu PGrossman RBayardo RBennett K(2005)Pattern-based similarity search for microarray dataProceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining10.1145/1081870.1081978(814-819)Online publication date: 21-Aug-2005
https://dl.acm.org/doi/10.1145/1081870.1081978
Charikar MReif J(2002)Similarity estimation techniques from rounding algorithmsProceedings of the thiry-fourth annual ACM symposium on Theory of computing10.1145/509907.509965(380-388)Online publication date: 19-May-2002
https://dl.acm.org/doi/10.1145/509907.509965
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

On Approximate Nearest Neighbors under l∞ Norm

Hausdorff distance with k-nearest neighbors

Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations