Skip to content

portegys/RelativeDistanceTree

Repository files navigation

RelativeDistanceTree

Relative distance tree for storing and searching multidimensional patterns.

Reference: A Search Technique for Pattern Recognition Using Relative Distances, Thomas E. Portegys, IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 17, NO. 9, SEPTEMBER 1995

Abstract: A technique for creating and searching a tree of patterns using relative distances is presented. The search is conducted to find patterns which are nearest neighbors of a given test pattern. The structure of the tree is such that the search time is proportional to the distance between the test pattern and its nearest neighbor, since a larger tree, which can be expected on average to contain closer neighbors, can be searched faster than a smaller tree.

About

Relative distance tree for storing and searching multidimensional patterns.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published