Approximate nearest neighbor search for lp-Spaces (2 < p < ∞) via Embeddings

Yair Bartal, Lee Ad Gottlieb*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and l1, few non-trivial algorithms are known for lp when 2 < p < ∞. In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the best known approximation factor guarantees in this setting.

Original languageAmerican English
Title of host publicationLATIN 2018
Subtitle of host publicationTheoretical Informatics - 13th Latin American Symposium, Proceedings
EditorsMiguel A. Mosteiro, Michael A. Bender, Martin Farach-Colton
PublisherSpringer Verlag
Pages120-133
Number of pages14
ISBN (Print)9783319774039
DOIs
StatePublished - 2018
Event13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 - Buenos Aires, Argentina
Duration: 16 Apr 201819 Apr 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10807 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Latin American Theoretical Informatics, LATIN 2018
Country/TerritoryArgentina
CityBuenos Aires
Period16/04/1819/04/18

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018.

Fingerprint

Dive into the research topics of 'Approximate nearest neighbor search for lp-Spaces (2 < p < ∞) via Embeddings'. Together they form a unique fingerprint.

Cite this