An optimized version of the Approximating and Eliminating Search Algorithm (AESA) for Nearest Neighbour classification
نویسنده
چکیده
The Approximating and Eliminating Search Algorithm (AESA) and related AESA-based techniques are among the fastest methods for (k-)Nearest Neighbour(s) searching in general metric spaces. These techniques can be optimized for the (easier) (k-)Nearest Neighbour(s) classification problem. In particular, an optimized version of the AESA is proposed here which is shown to be significantly faster than the AESA, both in terms of distance computations and overhead.
منابع مشابه
Fast k-nearest-neighbours searching through extended versions of the approximating and eliminating search algorithm (AESA)
The Approximating and Eliminating Search Algorithm (AESA) is probably the technique requiring the fewest distance computations for Nearest-Neighbour searching in general metric spaces. In this paper, we propose direct and refined extensions to the AESA for finding k-NearestNeighbours. Results of a number of experiments involving synthetic data are reported, showing that both extensions, and esp...
متن کاملA new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
متن کامل
An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation
Ramasubramanian, V. and K.K. Paliwal, An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation, Pattern Recognition Letters 13 (1992) 471-480. An efficient approximation-elimination search algorithm for fast nearest-neighbour search is proposed based on a spherical distance coordinate formuTation, where a vector in K...
متن کامل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...
متن کامل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...
متن کامل