Menu

Tree [r6] /
 History

HTTPS access


File Date Author Commit
 RDclient.java 2015-08-06 portegys [r6] Port to Java.
 RDtree.cpp 2011-05-06 portegys [r1] Initial commit.
 RDtree.hpp 2015-07-13 portegys [r5] Update comments.
 RDtree.java 2015-08-06 portegys [r6] Port to Java.
 RDtree.sln 2011-05-06 portegys [r1] Initial commit.
 RDtree.vcxproj 2011-05-06 portegys [r1] Initial commit.
 Readme.txt 2015-08-06 portegys [r6] Port to Java.
 driver.cpp 2011-05-06 portegys [r1] Initial commit.
 fileio.cpp 2015-04-25 portegys [r4] Fix path variable.
 fileio.h 2011-05-17 portegys [r2] Fix compiler warnings.
 makefile 2015-08-06 portegys [r6] Port to Java.

Read Me

Relative distance tree for storing and searching multidimensional patterns.

Reference:
A Search Technique for Pattern Recognition Using Relative Distances
Thomas E. Portegys (portegys@gmail.com)
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.

Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.