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.
To find the nearest leader in step 1, how many cosine computations do we do?
Why did we have √N in the first place?
What is the effect of the constants b1, b2 on the previous slide?
Devise an example where this is likely to fail – i.e., we miss one of the K nearest docs.
Likely under random sampling.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License