An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number of recor...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!