A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements.
Luisa MicóJosé OncinaEnrique VidalPublished in: Pattern Recognit. Lett. (1994)
Keyphrases
- memory requirements
- nearest neighbour
- search algorithm
- preprocessing
- computational complexity
- memory usage
- k nearest neighbour
- search space
- memory space
- computational speed
- euclidean distance
- nearest neighbour algorithm
- knn
- heuristic search
- decision trees
- rough sets
- low memory
- k nearest neighbor
- database
- feature vectors
- training set
- lower bound
- image processing