A Survey on Nearest Neighbor Search Methods
نویسندگان
چکیده
منابع مشابه
A Survey on Nearest Neighbor Search Methods
Nowadays, the need to techniques, approaches, and algorithms to search on data is increased due to improvements in computer science and increasing amount of information. This ever increasing information volume has led to time and computation complexity. Recently, different methods to solve such problems are proposed. Among the others, nearest neighbor search is one of the best techniques to thi...
متن کاملOverview of Nearest Neighbor Subtree Search Methods
In many scientific areas there is a frequent need to extract a common pattern from multiple data. In most cases, however, an approximate but low cost solution is preferred to a high cost exact match. To establish a fast search engine an efficient heuristic method should be implemented. Our investigation is devoted to the approximate nearest neighbor search (ANN) for unordered labeled trees. The...
متن کاملA Parallel Algorithms on Nearest Neighbor Search
The (k-)nearest neighbor searching has very high computational costs. The algorithms presented for nearest neighbor search in high dimensional spaces have have suffered from curse of dimensionality, which affects either runtime or storage requirements of the algorithms terribly. Parallelization of nearest neighbor search is a suitable solution for decreasing the workload caused by nearest neigh...
متن کاملPROTOTYPE GENERATION FOR NEAREST NEIGHBOR CLASSIFICATION: SURVEY OF METHODS 1 Prototype Generation for Nearest Neighbor Classification: Survey of Methods
Prototype generation techniques have arisen as very competitive methods for enhancing the nearest neighbor classifier through data reduction. A great number of methods tackling the prototype generation problem have been proposed in the literature. This technical report provides a survey of the most representative algorithms developed so far. A previously proposed categorization has been used to...
متن کاملContinuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., “find all my nearest gas stations during my route from point s to point e”). The result contains a set of tuples, such that point is the NN of all points in the corresponding interval. Existing methods for continuous nearest neighbor search are based on the repetitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16754-7073