An efficient nearest neighbor search in high-dimensional data spaces

被引：0

作者：

Lee, DH ^{[1
]}

Kim, HJ ^{[1
]}

机构：

[1] Seoul Natl Univ, Dept Comp Engn, Gwanak Gu, Seoul 151742, South Korea

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 81卷 / 05期

关键词：

algorithms; incremental nearest neighbor search; high-dimensional index structure; SPY-TEC;

D O I：

10.1016/S0020-0190(01)00236-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An incremental nearest neighbor search algorithm for high dimensional data spaces was presented. MinDist, a new metric was introduced for guiding an ordered best-first traversal when finding nearest neighbors on the SPY-TEC, an efficient index structure for similarity search in high-dimensional spaces. The practical impact of the algorithm on the SPY-TEC was calculated and compared with the R tree, X tree and the sequential scan.

引用

页码：239 / 246

页数：8

共 50 条

[1] Nearest Neighbor Search in High-Dimensional Spaces
Andoni, Alexandr
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 1 - 1
[2] An algorithm for incremental nearest neighbor search in high-dimensional data spaces
Lee, DH
Lee, HD
Choi, IH
Kim, HJ
HUMAN SOCIETY AND THE INTERNET, PROCEEDINGS: INTERNET-RELATED SOCIO-ECONOMIC ISSUES, 2001, 2105 : 436 - 453
[3] Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces
Zhao, Xi
Tian, Yao
Huang, Kai
Zheng, Bolong
Zhou, Xiaofang
PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (08): : 1979 - 1991
[4] Efficient search for approximate nearest neighbor in high dimensional spaces
Kushilevitz, E
Ostrovsky, R
Rabani, Y
SIAM JOURNAL ON COMPUTING, 2000, 30 (02) : 457 - 474
[5] On optimizing nearest neighbor queries in high-dimensional data spaces
Berchtold, S
Böhm, C
Keim, D
Krebs, F
Kriegel, HP
DATABASE THEORY - ICDT 2001, PROCEEDINGS, 2001, 1973 : 435 - 449
[6] Nearest neighbor search on vertically partitioned high-dimensional data
Dellis, E
Seeger, B
Vlachou, A
DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2005, 3589 : 243 - 253
[7] High-Dimensional Nearest Neighbor Search with Remote Data Centers
Wang, Changzhou
Wang, Xiaoyang Sean
Knowledge and Information Systems, 2002, 4 (04) : 440 - 465
[8] HDIdx: High-dimensional indexing for efficient approximate nearest neighbor search
Wan, Ji
Tang, Sheng
Zhang, Yongdong
Li, Jintao
Wu, Pengcheng
Hoi, Steven C. H.
NEUROCOMPUTING, 2017, 237 : 401 - 404
[9] Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data
Bashyam, K. G. Renga
Vadhiyar, Sathish
2020 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING (CLUSTER 2020), 2020, : 294 - 302
[10] An Efficient Framework for Approximate Nearest Neighbor Search on High-Dimensional Multi-metric Data
Uemura, Reon
Amagata, Daichi
Hara, Takahiro
SIMILARITY SEARCH AND APPLICATIONS, SISAP 2024, 2025, 15268 : 3 - 17

← 1 2 3 4 5 →