Approaches to kNN Retrieval (cont)
Above approaches try to reduce number of objects considered.
- cf. indexes in relational databases
Other optimisations to make kNN retrieval faster
- reduce I/O by reducing size of vectors (compression, d-reduction)
- reduce I/O by placing "similar" records together (clustering)
- reduce I/O by remembering previous pages (caching)
- reduce cpu by making distance computation faster
|