DMCA
An algorithm for finding best matches in logarithmic expected time (1977)
| Venue: | ACM Transactions on Mathematical Software |
| Citations: | 764 - 2 self |
BibTeX
@ARTICLE{Friedman77analgorithm,
author = {Jerome H. Friedman and Jon Louis Bentley and Raphael Ari Finkel},
title = {An algorithm for finding best matches in logarithmic expected time},
journal = {ACM Transactions on Mathematical Software},
year = {1977}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 records examined in each search is independent of the file size. The expected computation to perform each search is proportional-to 1ogN. Empirical evidence suggests that except for very small files, this algorithm is considerably faster than other methods.
