REDUCING THE DIMENSIONAL DEPENDENCE FOR RANK-BASED SIMILARITY SEARCH

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 not on the other properties of the underlying space, such as the triangle inequality. Objects are selected according to their ranks with res...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International Journal of Advanced Engineering and Science 2016-05, Vol.5 (1), p.10-10
Hauptverfasser:	Shelke, Jeevan Arjun, Humnabadkar, Viresh Shivshankar, Kale, Tushar Tinajirao, Kulkarni, Girish Gundopant, Kulkarni, P S
Format:	Artikel
Sprache:	eng
Schlagworte:	Extreme values Inequalities Pruning Query processing Searching Similarity State of the art Strategy
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!