资 源 简 介
Introduction
SketchSortE(1) is a software for all pairs similarity search. It takes as an input data points and outputs approximate neighbor pairs within a Euclidean distance threshold. First, the input data points are mapped to binary bit strings (sketches) by sift-invaliant kernel based hashing (3), and then neighbor pairs of strings within a Hamming distance are enumerated by the multiple sorting method (2). Finally, the Euclidean distances for such neighbor pairs are calculated. If the Euclidean distance for a neighbor pair is no more than a user-specified threshold , the neighbor pair is output. One might worry about missed nearest neighbor pairs by our method. A theoretical bound of the expectation of missing edge ratio is derived. It enables us to set parameters so as to limit the empirical missing edge ratio as small as possible.
Quick Start
To compile SketchSortE , please type the followings:
tar -x
