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

Yair Bartal; Lee Ad Gottlieb

doi:10.1007/978-3-319-77404-6_10

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

Yair Bartal, Lee Ad Gottlieb^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and l₁, few non-trivial algorithms are known for l_p 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 language	English
Title of host publication	LATIN 2018
Subtitle of host publication	Theoretical Informatics - 13th Latin American Symposium, Proceedings
Editors	Miguel A. Mosteiro, Michael A. Bender, Martin Farach-Colton
Publisher	Springer Verlag
Pages	120-133
Number of pages	14
ISBN (Print)	9783319774039
DOIs	https://doi.org/10.1007/978-3-319-77404-6_10
State	Published - 2018
Event	13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 - Buenos Aires, Argentina Duration: 16 Apr 2018 → 19 Apr 2018

Publication series

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

Conference

Conference	13th International Symposium on Latin American Theoretical Informatics, LATIN 2018
Country/Territory	Argentina
City	Buenos Aires
Period	16/04/18 → 19/04/18

Bibliographical note

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

Access to Document

10.1007/978-3-319-77404-6_10

Cite this

Bartal, Y., & Gottlieb, L. A. (2018). Approximate nearest neighbor search for l_p-Spaces (2 < p < ∞) via Embeddings. In M. A. Mosteiro, M. A. Bender, & M. Farach-Colton (Eds.), LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings (pp. 120-133). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10807 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-77404-6_10

Bartal, Yair ; Gottlieb, Lee Ad. / Approximate nearest neighbor search for l_p-Spaces (2 < p < ∞) via Embeddings. LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. editor / Miguel A. Mosteiro ; Michael A. Bender ; Martin Farach-Colton. Springer Verlag, 2018. pp. 120-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{77ef9cce97624809b1384ff0c7fe1030,

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

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.",

author = "Yair Bartal and Gottlieb, {Lee Ad}",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.; 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 ; Conference date: 16-04-2018 Through 19-04-2018",

year = "2018",

doi = "10.1007/978-3-319-77404-6_10",

language = "אנגלית",

isbn = "9783319774039",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "120--133",

editor = "Mosteiro, {Miguel A.} and Bender, {Michael A.} and Martin Farach-Colton",

booktitle = "LATIN 2018",

address = "גרמניה",

}

Bartal, Y & Gottlieb, LA 2018, Approximate nearest neighbor search for l_p-Spaces (2 < p < ∞) via Embeddings. in MA Mosteiro, MA Bender & M Farach-Colton (eds), LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10807 LNCS, Springer Verlag, pp. 120-133, 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018, Buenos Aires, Argentina, 16/04/18. https://doi.org/10.1007/978-3-319-77404-6_10

Approximate nearest neighbor search for l_p-Spaces (2 < p < ∞) via Embeddings. / Bartal, Yair; Gottlieb, Lee Ad.
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. ed. / Miguel A. Mosteiro; Michael A. Bender; Martin Farach-Colton. Springer Verlag, 2018. p. 120-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10807 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Bartal, Yair

AU - Gottlieb, Lee Ad

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

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85045399053&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-77404-6_10

DO - 10.1007/978-3-319-77404-6_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85045399053

SN - 9783319774039

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 120

EP - 133

BT - LATIN 2018

A2 - Mosteiro, Miguel A.

A2 - Bender, Michael A.

A2 - Farach-Colton, Martin

PB - Springer Verlag

T2 - 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018

Y2 - 16 April 2018 through 19 April 2018

ER -

Bartal Y, Gottlieb LA. Approximate nearest neighbor search for l_p-Spaces (2 < p < ∞) via Embeddings. In Mosteiro MA, Bender MA, Farach-Colton M, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. Springer Verlag. 2018. p. 120-133. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-77404-6_10