Efficient approximate nearest neighbor search on high-dimensional vectors by graph and quantization
Approximate nearest neighbor (ANN) search in high-dimensional Euclidean space has a broad range of applications. Among existing ANN algorithms, graph-based methods currently show superior performance in terms of the time-accuracy trade-off. Yet, they have performance bottlenecks due to the random me...
Saved in:
Main Author: | Gou, Yutong |
---|---|
Other Authors: | Long Cheng |
Format: | Thesis-Master by Research |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/181650 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
HDIdx: High-dimensional indexing for efficient approximate nearest neighbor search
by: WAN, Ji, et al.
Published: (2016) -
Search Continuous Nearest Neighbor on Air
by: ZHENG, Baihua, et al.
Published: (2004) -
Transitive Nearest Neighbor Search in Mobile Environments
by: ZHENG, Baihua, et al.
Published: (2007) -
Continuous Nearest Neighbor Search in the Presence of Obstacles
by: GAO, Yunjun, et al.
Published: (2011) -
Search K-Nearest Neighbors On Air
by: ZHENG, Baihua, et al.
Published: (2003)