protected BoundedPriorityQueue < Result > computeNearestNeighborsInternal ( int k , int iid ) throws Exception { double [ ] queryVector = getVector ( iid ) ; // get the vector with this internal id return computeNearestNeighborsInternal ( k , queryVector ) ; }
Computes the k - nearest neighbors of the vector with the given internal id . The search is exhaustive but includes some optimizations that make it faster especially for high dimensional vectors .