Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings

Yair Bartal; Lee Ad Gottlieb

doi:10.1016/j.tcs.2018.07.011

Approximate nearest neighbor search for ℓ_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: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ₁, few non-trivial algorithms are known for ℓ_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	American English
Pages (from-to)	27-35
Number of pages	9
Journal	Theoretical Computer Science
Volume	757
DOIs	https://doi.org/10.1016/j.tcs.2018.07.011
State	Published - 24 Jan 2019

Bibliographical note

Funding Information:
Y. Bartal is supported in part by an Israel Science Foundation grant #1817/17.L. Gottlieb is supported in part by an Israel Science Foundation grant #755/15.

Publisher Copyright:
© 2018 Elsevier B.V.

Keywords

Nearest neighbor search
ℓ spaces

Access to Document

10.1016/j.tcs.2018.07.011

Cite this

@article{ad608a06f698421093300501c4560885,

title = "Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings",

abstract = "While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2",

keywords = "Nearest neighbor search, ℓ spaces",

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

note = "Funding Information: Y. Bartal is supported in part by an Israel Science Foundation grant #1817/17.L. Gottlieb is supported in part by an Israel Science Foundation grant #755/15. Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = jan,

day = "24",

doi = "10.1016/j.tcs.2018.07.011",

language = "American English",

volume = "757",

pages = "27--35",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings

AU - Bartal, Yair

AU - Gottlieb, Lee Ad

N1 - Funding Information: Y. Bartal is supported in part by an Israel Science Foundation grant #1817/17.L. Gottlieb is supported in part by an Israel Science Foundation grant #755/15. Publisher Copyright: © 2018 Elsevier B.V.

PY - 2019/1/24

Y1 - 2019/1/24

N2 - While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2

AB - While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2

KW - Nearest neighbor search

KW - ℓ spaces

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

U2 - 10.1016/j.tcs.2018.07.011

DO - 10.1016/j.tcs.2018.07.011

M3 - Article

AN - SCOPUS:85050795689

SN - 0304-3975

VL - 757

SP - 27

EP - 35

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Approximate nearest neighbor search for ℓ_p-spaces (2 < p < ∞) via embeddings

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this

Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this

Approximate nearest neighbor search for ℓ_p-spaces (2 < p < ∞) via embeddings