[prev] [index] [next]

High-dimensional Nearest Neighbours Search

The problem of finding k similar images is an instance of the more general problem ...

Given:

  • a set of data points in a d-dimensional space

  • a specific query point q in that space

find the k data points in the set that are closest to q.

A solution to this problem would be useful in several areas:

  • information retrieval, multimedia databases, machine learning, ...


[prev] [index] [next]