Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Find a set A of contenders, with K < |A| << N
A does not necessarily contain the top K, but has many docs from among the top K
Return the top K docs in A
Think of A as pruning non-contenders
The same approach is also used for other (non-cosine) scoring functions
Will look at several schemes following this approach
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License