Skip to search formSkip to main contentSkip to account menu

(1+ε)-approximate nearest neighbor search

Known as: Ε-approximate nearest neighbor search 
(1+ε)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+ε)-approximate nearest… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Curse of dimensionalityNearest neighbor search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A novel non-parametric method for time series classification based on k-Nearest Neighbors and Dynamic Time Warping Barycenter Averaging
2019
2019
Nearest Neighbor Classifiers Versus Random Forests and Support Vector Machines
Recent experimental studies have shown that the support vector machine and the random forest are "stand out" models that… 
2015
2015
Search Retargeting using Directed Query Embeddings
Determining user audience for online ad campaigns is a critical problem to companies competing in online advertising space. One… 
2015
2015
Quantitative diagnosis of bladder cancer by morphometric analysis of HE images
In clinical practice, histopathological analysis of biopsied tissue is the main method for bladder cancer diagnosis and prognosis… 
Highly Cited
2014
Highly Cited
2014
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index
Nearest neighbor searches in high-dimensional space have many important applications in domains such as data mining, and… 
2014
2014
Rapid AkNN Query Processing for Fast Classification of Multidimensional Data in the Cloud
A $k$-nearest neighbor ($k$NN) query determines the $k$ nearest points, using distance metrics, from a specific location. An all… 
2012
2012
Continuous All k-Nearest-Neighbor Querying in Smartphone Networks
Consider a centralized query operator that identifies to every smartphone user its k geographically nearest neighbors at all… 
Highly Cited
2009
Highly Cited
2009
How k-nearest neighbor parameters affect its performance
The k-Nearest Neighbor is one of the simplest Machine Learning algorithms. Besides its simplicity, k-Nearest Neighbor is a widely… 
Highly Cited
2006
Highly Cited
2006
Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval
With the rapid increase in both centralized video archives and distributed WWW video resources, content-based video retrieval is… 
2001
2001
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)