HDIdx: High-dimensional indexing for efficient approximate nearest neighbor search
Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts have been focusing on approximate NN search a...
Saved in:
Main Authors: | WAN, Ji, TANG, Sheng, ZHANG, Yongdong, LI, Jintao, WU, Pengcheng, HOI, Steven C. H. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3413 https://ink.library.smu.edu.sg/context/sis_research/article/4414/viewcontent/HDIdx_Neurocomputing_2016_pp.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Authenticated multistep nearest neighbor search
by: Papadopoulos, S., et al.
Published: (2013) -
Approximate k-NN graph construction: A generic online approach
by: ZHAO, Wan-Lei, et al.
Published: (2022) -
Min-max hash for jaccard similarity
by: Ji, J., et al.
Published: (2014) -
Ranked Reverse Nearest Neighbor Search
by: LEE, Ken C. K., et al.
Published: (2008) -
Finding all nearest neighbors with a single graph traversal
by: XU, Yixin, et al.
Published: (2018)