A Nearest Neighbor Search Algorithm for LR-LD on High SNR
نویسندگان
چکیده
منابع مشابه
Nearest Neighbor Search Algorithm
A fundamental activity common to image processing, pattern recognition, and clustering algorithm involves searching set of n , k-dimensional data for one which is nearest to a given target data with respect to distance function . Our goal is to find search algorithms with are full search equivalent -which is resulting match as a good as we could obtain if we were to search the set exhausting. 1...
متن کاملA Simple Algorithm for Nearest Neighbor Search in High Dimensions
Finding the closest point in a high-dimensional space is a problem that often occurs in pattern recognition. Unfortunately, the complexity of most known search algorithms grows exponentially with dimension, which makes them unsuitable for high dimensions. However, for most applications, the closest point is of interest only if it is closer than some pre-defined distance. In the article ”A Simpl...
متن کاملA Simple Algorithm for Nearest Neighbor Search in High Dimensions
The problem of finding the closest point in high-dimensional spaces is common in pattern recognition. Unfortunately, the complexity of most existing search algorithms, such as k-d tree and R-tree, grows exponentially with dimension, making them impractical for dimensionality above 15. In nearly all applications, the closest point is of interest only if it lies within a user-specified distance e...
متن کاملRandomized Algorithm for Approximate Nearest Neighbor Search in High Dimensions
A randomized algorithm employs a degree of randomness as part of its logic with uniform random bits as an auxiliary input to guide its behavior, in the hope of achieving good average runtime performance over all possible choices of the random bits. In this paper, we formulate a randomized algorithm capable of finding approximate nearest neighbors, specifically in high dimensional datasets. The ...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networked and Distributed Computing
سال: 2017
ISSN: 2211-7946
DOI: 10.2991/ijndc.2017.5.1.5