rank-based search

2 articles · search the full text for this term

• Published Subscription 20 Apr 2016

  Reducing the Dimensional Dependence for Rank-Based Similarity Search

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

  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 …

  Published in Journal of Advanced Database Management & Systems · Vol. 3, Issue 1, 2016 · pp. 9–17 Read article →

• Published Subscription 16 Nov 2015

  Reducing the Dimensional Dependence for Rank-based Similarity Search

  By Jeevan Arjun Shelke, Viresh Shivshankar Humnabadkar, Tushar Tinajirao Kale, Girish Gundopant Kulkarni, PS Kulkarni

  Abstract: In this paper, we try to introduce a data structure for k-NN search, the Rank Cover Tree (RCT). The pruning tests for RCT rely on the comparison of similarity values 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 …

  Published in Journal of Advanced Database Management & Systems · Vol. 2, Issue 3, 2015 · pp. 20–25 Read article →