The Effects of Dimensionality Curse in High Dimensional kNN Search

2011 ◽  
Author(s):  
Nikolaos Kouiroukidis ◽  
Georgios Evangelidis
Keyword(s):  
High Dimensional ◽  
Knn Search ◽  
Dimensionality Curse

scholarly journals MFI-tree: An effective multi-feature index structure for weighted query application

2010 ◽  
Vol 7 (1) ◽  
pp. 139-152 ◽  
Author(s):  
Yunfeng He ◽  
Yu Junqing
Keyword(s):  
Video Retrieval ◽  
Search Algorithm ◽  
Search Space ◽  
Video Data ◽  
Index Structure ◽  
High Dimensional ◽  
Indexing Structure ◽  
Knn Search ◽  
Level Cluster ◽  
Index Tree

Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree employs tree structure which is beneficial for the browsing application, and retrieves the last level cluster nodes in retrieval application to improve the performance. Aggressive Decided Distance for kNN (ADD-kNN) search algorithm is designed because it can effectively reduce the distance to prune the search space. Experimental results demonstrate that the MFITree and ADD-kNN algorithm have the advantages over sequential scan in performance.

LGTM: A Fast and Accurate kNN Search Algorithm in High-Dimensional Spaces

2021 ◽  
pp. 220-231
Author(s):  
Yusuke Arai ◽  
Daichi Amagata ◽  
Sumio Fujita ◽  
Takahiro Hara
Keyword(s):  
Search Algorithm ◽  
High Dimensional ◽  
Knn Search
Sign in / Sign up

Export Citation Format

Share Document