Reducing the Dimensional Dependence for Rank-Based Similarity Search

Jeevan Arjun Shelke; Viresh Shivshankar Humnabadkar; Tushar Tinajirao Kale; Girish Gundopant Kulkarni; P. S. Kulkarni

doi:10.37591/joadms.v3i1.651

Abstract

In this paper a data structure for k-NN search, the rank cover tree (RCT) is implemented. The pruning tests for RCT rely on the comparison of similarity values and not on the other properties of the underlying space, such as the triangle inequality. Objects are selected according to their ranks with respect to the query object, allowing much tighter control on the overall execution costs. Theoretical analysis shows that with very high probability, the RCT returns a correct query result in time that depends very competitively on a measure of the intrinsic dimensionality of the data set. The experimental results for the RCT show that non-metric pruning strategies for similarity search can be practical even when the representational dimension of the data is extremely high. They also show that the RCT is capable of meeting or exceeding the level of performance of state-of-the-art methods that make use of metric pruning or other selection tests involving numerical constraints on distance values.Cite this Article Jeevan Arjun Shelke, Viresh Shivshankar Humnabadkar, Tushar Tinajirao Kale et al. Reducing the Dimensional Dependence for Rank-Based Similarity Search. Journal of Advanced Database Management & Systems. 2016; 3(1): 9–17p.

Abstract

Keywords