EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations

Jianyang Gao, Cheng Long

Proceedings of the ACM on Management of Data · 13.06.2023 · 1 (2) · 1-27

DOI: 10.1145/3589282 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 20.06.2023. Verfasst von Jianyang Gao und 1 weiteren Autor:innen. Die Arbeit wurde bisher 86-mal zitiert (Crossref) und nennt 63 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0). Gefördert von: Ministry of Education, Singapore.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Approximate K nearest neighbor (AKNN) search in the high-dimensional Euclidean vector space is a fundamental and challenging problem. We observe that in high-dimensional space, the time consumption of nearly all AKNN algorithms is dominated by that of the distance comparison operations (DCOs). For each operation, it scans full dimensions of an object and thus, runs in linear time wrt the dimensionality. To speed it up, we propose a randomized algorithm named ADSampling which runs in logarithmic time wrt the dimensionality for the majority of DCOs and succeeds with high probability. In addition, based on ADSampling we develop one generic and two algorithm-specific techniques as plugins to enhance existing AKNN algorithms. Both theoretical and empirical studies confirm that: (1) our techniques introduce nearly no accuracy loss and (2) they consistently improve the efficiency.

Förderung

  • Ministry of Education, Singapore

Zitieren

APA

Gao, J., & Long, C. (2023). High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations. Proceedings of the ACM on Management of Data, 1(2), 1-27. https://doi.org/10.1145/3589282

Vancouver

Gao J, Long C. High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations. Proceedings of the ACM on Management of Data. 2023;1(2):1-27. doi:10.1145/3589282

BibTeX
@article{Gao2023,
  author = {Gao, Jianyang and Long, Cheng},
  title = {High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2023},
  volume = {1},
  number = {2},
  pages = {1--27},
  doi = {10.1145/3589282}
}
Kostenlos starten →