An Algorithm for Finding Best Matches in Logarithmic Expected Time
article Free Access Share on An Algorithm for Finding Best Matches in Logarithmic Expected Time Authors: Jerome H. Friedman Stanford Linear Accelerator Center, Stanford Universi...
Publications
3 shownAn Algroithm for Finding Best Matches in Logarithmic Expected Time
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 ...
Frequent Co-Authors
Researcher Info
- h-index
- 3
- Publications
- 3
- Citations
- 4,754
- Institution
- Stanford University
External Links
Identifiers
- ORCID
- 0000-0003-3896-6743
Impact Metrics
h-index
3
h-index: Number of publications with at least h citations each.