Telescope indexing for k-nearest neighbor search algorithms over high dimensional data & large data sets
Abstract When k-Nearest-Neighbors ( $$k$$ -NN) was conceived more than 70 years ago, computation, as we use it now, would be hardly recognizable. Since then, technology has improved by orders of magnitude, including unprecedented connectivity. However, $$k$$ -NN has remained virtually unchanged, exp...
Saved in:
| Main Authors: | Madhavan K R, Hasan Kurban, Oguzhan M. Kulekci, Mehmet M. Dalkilic |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-09856-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Random k conditional nearest neighbor for high-dimensional data
by: Jiaxuan Lu, et al.
Published: (2025-01-01) -
Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing
by: Cong PENG, et al.
Published: (2017-06-01) -
Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing
by: Cong PENG, et al.
Published: (2017-06-01) -
SLSB-forest:approximate k nearest neighbors searching on high dimensional data
by: Tu QIAN, et al.
Published: (2017-09-01) -
Effective k-nearest neighbor models for data classification enhancement
by: Ali A. Amer, et al.
Published: (2025-04-01)