article

Nearest-neighbor-preserving embeddings

Authors:

Assaf NaorAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 3, Issue 3

Pages 31 - es

https://doi.org/10.1145/1273340.1273347

Published: 01 August 2007 Publication History

Abstract

In this article we introduce the notion of nearest-neighbor-preserving embeddings. These are randomized embeddings between two metric spaces which preserve the (approximate) nearest-neighbors. We give two examples of such embeddings for Euclidean metrics with low “intrinsic” dimension. Combining the embeddings with known data structures yields the best-known approximate nearest-neighbor data structures for such metrics.

References

[1]

Achlioptas, D. 2003. Database-Friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 4, 671--687.

Digital Library

[2]

Alon, N. 2003. Problems and results in extremal combinatorics. I. Discrete Math. 273, 1--3, 31--53.

Digital Library

[3]

Andoni, A., Datar, M., Immorlica, N., Indyk, P., and Mirrokni, V. 2005. Locality-Sensitive hashing scheme based on stable distributions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice. MIT Press, Cambridge, MA.

[4]

Arya, S., and Malamatos, T. 2002. Linear-Size approximate voronoi diagrams. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 147--155.

Digital Library

[5]

Barvinok, A. 1997. Approximate counting via random optimization. Random Struct. Alg. 11, 2, 187--198.

Digital Library

[6]

Barvinok, A., and Samorodnitsky, A. 2001. The distance approach to approximate combinatorial counting. Geom. Funct. Anal. 11, 5, 871--899.

[7]

Barvinok, A., and Samorodnitsky, A. 2004. Random weighting, asymptotic counting, and inverse isoperimetry. Preprint.

[8]

Brinkman, B., and Charikar, M. 2003. On the impossibility of dimension reduction in l₁. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science.

Digital Library

[9]

Clarkson, K. 2005. Nearest-Neighbor searching and metric space dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice. MIT Press, Cambridge, MA.

[10]

Dasgupta, S., and Gupta, A. 2003. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Alg. 22, 1, 60--65.

Digital Library

[11]

Durrett, R. 1996. Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, CA.

[12]

Frankl, P., and Maehara, H. 1988. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Ser. B 44, 3, 355--362.

Digital Library

[13]

Gordon, Y. 1988. On Milman's inequality and random subspaces which escape through a mesh in Rⁿ. In Geometric Aspects of Functional Analysis. Lecture Notes in Math., vol. 1317. Springer, Berlin, 84--106.

[14]

Guedon, O., and Zvavitch, A. 2003. Supremum of a process in terms of trees. In Geometric Aspects of Functional Analysis. Lecture Notes in Math., vol. 1807. Springer, Berlin, 136--147.

[15]

Gupta, A., Krauthgamer, R., and Lee, J. R. 2003. Bounded geometries, fractals, and low-distortion embeddings. In Annual Symposium on Foundations of Computer Science.

Digital Library

[16]

Har-Peled, S. 2001. A replacement for voronoi diagrams of near linear size. In Annual Symposium on Foundations of Computer Science.

Digital Library

[17]

Heinonen, J. 2001. Lectures on Analysis on Metric Spaces. Universitext. Springer, New York.

[18]

Indyk, P. 1998. On approximate nearest neighbors in non-Euclidean spaces. In Proceedings of the Symposium on Foundations of Computer Science. 148--155.

Digital Library

[19]

Indyk, P. 2000. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Annual Symposium on Foundations of Computer Science.

Digital Library

[20]

Indyk, P., and Motwani, R. 1998. Approximate nearest neighbor: Towards removing the curse of dimensionality. In Proceedings of the Symposium on Theory of Computing.

Digital Library

[21]

Indyk, P., and Motwani, R. 1999. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC'98) (Dallas, TX). ACM, New York, 604--613.

Digital Library

[22]

Johnson, W. B., and Lindenstrauss, J. 1984. Extensions of Lipschitz mappings into a Hilbert space. In Proceedings of the Conference in Modern Analysis and Probability (New Haven, Conn., 1982). American Mathematics Society Providence, RI, 189--206.

[23]

Klartag, B., and Mendelson, S. Empirical processes and random projections. J. Funct. Anal. To appear.

[24]

Konyagin, S. V., and Voll′berg, A. L. 1987. On measures with the doubling condition. Izv. Akad. Nauk SSSR Ser. Mat. 51, 3, 666--675.

[25]

Krauthgamer, R., and Lee, J. R. 2004. Navigating nets: Simple algorithms for proximity search. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.

Digital Library

[26]

Kushilevitz, E., Ostrovsky, R., and Rabani, Y. 1998. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proceedings of the 30th ACM Symposium on Theory of Computing. 614--623.

Digital Library

[27]

Lang, U., and Plaut, C. 2001. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata 87, 1--3, 285--307.

[28]

Ledoux, M., and Talagrand, M. 1991. Probability in Banach spaces. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) {Results in Mathematics and Related Areas (3)}, vol. 23. Springer, Berlin. Isoperimetry and processes.

[29]

Lee, J. R., Mendel, M., and Naor, A. Metric structures in l₁: Dimension, snowflakes, and average distortion. Euro. J. Combin. To appear.

Digital Library

[30]

Lee, J. R., and Naor, A. 2004. Embedding the diamond graph in L_p and dimension reduction in l₁. Geom. Funct. Anal. 14, 4, 745--747.

[31]

Magen, A. 2002. Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM).

Digital Library

[32]

Matoušek, J. 2002. Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York.

Digital Library

[33]

Schechtman, G. Two observations regarding embedding subsets of Euclidean spaces in normed spaces. Adv. Math. To appear.

[34]

Schechtman, G. 1989. A remark concerning the dependence on ε in Dvoretzky's theorem. In Geometric Aspects of Functional Analysis (1987--88). Lecture Notes in Math., vol. 1376. Springer, Berlin, 274--277.

[35]

Talagrand, M. 2001. Majorizing measures without measures. Ann. Probab. 29, 1, 411--417.

[36]

Talagrand, M. 1996. Majorizing measures: The generic chaining. Ann. Probab. 24, 3, 1049--1103.

[37]

Talagrand, M. 1987. Regularity of Gaussian processes. Acta Math. 159, 1-2, 99--149.

Cited By

Kabán AReeve H(2024)Structure discovery in PAC-learning by random projectionsMachine Language10.1007/s10994-024-06531-0113:8(5685-5730)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10994-024-06531-0
Huang ZKabán AReeve H(2024)Efficient learning with projected histogramsData Mining and Knowledge Discovery10.1007/s10618-024-01063-6Online publication date: 1-Sep-2024
https://doi.org/10.1007/s10618-024-01063-6
Boudardara FBoussif AMeyer PGhazel M(2023)A review of abstraction methods towards verifying neural networksACM Transactions on Embedded Computing Systems10.1145/3617508Online publication date: 28-Aug-2023
https://dl.acm.org/doi/10.1145/3617508
Show More Cited By

Index Terms

Nearest-neighbor-preserving embeddings
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Local Fisher Discriminant Component Hashing for Fast Nearest Neighbor Classification
SSPR & SPR '08: Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition

This paper presents a novel approximate nearest neighbor classification scheme, <em>Local Fisher Discriminant Component Hashing</em> (LFDCH). Nearest neighbor (NN) classification is a popular technique in the field of pattern recognition but has poor ...
Face recognition using discriminative locality preserving vectors

We proposed an effective face recognition method based on the discriminative locality preserving vectors method (DLPV). Using the analysis of eigenspectrum modeling of locality preserving projections, we selected the reliable face variation subspace of ...
On kernel difference-weighted k-nearest neighbor classification
Special Issue: Non-parametric distance-based classification techniques and their applications

Nearest neighbor (NN) rule is one of the simplest and the most important methods in pattern recognition. In this paper, we propose a kernel difference-weighted k-nearest neighbor (KDF-KNN) method for pattern classification. The proposed method defines ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 3, Issue 3

August 2007

216 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1273340

Issue’s Table of Contents

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2007

Published in TALG Volume 3, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

106
Total Citations
View Citations
1,004
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)5

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kabán AReeve H(2024)Structure discovery in PAC-learning by random projectionsMachine Language10.1007/s10994-024-06531-0113:8(5685-5730)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10994-024-06531-0
Huang ZKabán AReeve H(2024)Efficient learning with projected histogramsData Mining and Knowledge Discovery10.1007/s10618-024-01063-6Online publication date: 1-Sep-2024
https://doi.org/10.1007/s10618-024-01063-6
Boudardara FBoussif AMeyer PGhazel M(2023)A review of abstraction methods towards verifying neural networksACM Transactions on Embedded Computing Systems10.1145/3617508Online publication date: 28-Aug-2023
https://dl.acm.org/doi/10.1145/3617508
Liberti LManca BPoirion P(2023)Random Projections for Linear Programming: An Improved Retrieval PhaseACM Journal of Experimental Algorithmics10.1145/361750628(1-33)Online publication date: 28-Aug-2023
https://dl.acm.org/doi/10.1145/3617506
Mehmood FShahzadi RGhafoor HAsim MGhani MMahmood WDengel A(2023)EnML: Multi-label Ensemble Learning for Urdu Text ClassificationACM Transactions on Asian and Low-Resource Language Information Processing10.1145/361611122:9(1-31)Online publication date: 22-Sep-2023
https://dl.acm.org/doi/10.1145/3616111
Li DXu JYang ZTang C(2023)Train Once, Locate Anytime for Anyone: Adversarial Learning based Wireless LocalizationACM Transactions on Sensor Networks10.1145/3614095Online publication date: 28-Aug-2023
https://dl.acm.org/doi/10.1145/3614095
Kandel ACharalampidis D(2023)Dimensionality Reduction for Smart Meter Data Using Variational Autoencoders2023 IEEE 20th International Conference on Smart Communities: Improving Quality of Life using AI, Robotics and IoT (HONET)10.1109/HONET59747.2023.10374936(111-116)Online publication date: 4-Dec-2023
https://doi.org/10.1109/HONET59747.2023.10374936
Emiris IMargonis VPsarros I(2023)Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ 1 Theoretical Computer Science10.1016/j.tcs.2022.11.031942:C(169-179)Online publication date: 9-Jan-2023
https://dl.acm.org/doi/10.1016/j.tcs.2022.11.031
Abhadiomhen SShen XSong HTian S(2023)Image edge preservation via low-rank residuals for robust subspace learningMultimedia Tools and Applications10.1007/s11042-023-17423-183:18(53715-53741)Online publication date: 23-Nov-2023
https://doi.org/10.1007/s11042-023-17423-1
Eskenazis A(2023)$$\varepsilon $$-Isometric Dimension Reduction for Incompressible Subsets of $$\ell _p$$Discrete & Computational Geometry10.1007/s00454-023-00587-w71:1(160-176)Online publication date: 21-Oct-2023
https://doi.org/10.1007/s00454-023-00587-w
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents