5. The method as claimed in claim 1, wherein a leaf refers to a group of closest prototypes and a rank refers to a list of ordered closest leaves.
7. The method as claimed in claim 5, wherein ranks calculated for higher levels of the hierarchical fast ranking tree are used to estimate ranks for the lower levels of the hierarchical fast ranking tree.