The efficiency of using k-d trees for finding nearest neighbors in discrete space

The efficiency of using k-d trees for finding nearest neighbors in discrete space

In this paper, we examine the efficiency of the k-d tree for retrieving from a file of fixed-length binary key records the best match to a given input word. We provide guidelines for determining if the search of the tree will provide any savings when compared with an exhaustive search.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1986-11, Vol.23 (4), p.215-218
Hauptverfasser: Murphy, O.J., Selkow, S.M.
Format: Artikel
Sprache:eng
Schlagworte:
Computer science
Information retrieval
k-d tree
Mathematics
multi-key searching
nearest neighbor
Searches
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we examine the efficiency of the k-d tree for retrieving from a file of fixed-length binary key records the best match to a given input word. We provide guidelines for determining if the search of the tree will provide any savings when compared with an exhaustive search.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(86)90138-9