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.
Naively, finding nearest neighbors requires a linear search through |D| documents in collection
But determining k nearest neighbors is the same as determining the k best retrievals using the test document as a query to a database of training documents.
Use standard vector space inverted index methods to find the k nearest neighbors.
Testing Time: O(B|Vt|) where B is the average number of training documents in which a test-document word appears.
Typically B << |D|
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License