Search Nearest Neighbors
Fast k-nearest neighbor searching algorithms including a kd-tree, cover-tree and the algorithm implemented in class package.
an input data matrix.
a query data matrix.
nearest neighbor searching algorithm.
the maximum number of nearest neighbors to search. The default value is set to 10.
return the indice of k nearest neighbors.
Shengqiao Li. To report any bugs or suggestions please email: email@example.com.
Bentley J.L. (1975), “Multidimensional binary search trees used for associative search,” Communication ACM, 18, 309-517.
Arya S. and Mount D.M. (1993), “Approximate nearest neighbor searching,” Proc. 4th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'93), 271-280.
Arya S., Mount D.M., Netanyahu N.S., Silverman R. and Wu A.Y. (1998), “An optimal algorithm for approximate nearest neighbor searching,” Journal of the ACM, 45, 891-923.
Beygelzimer A., Kakade S. and Langford J. (2006), “Cover trees for nearest neighbor,” ACM Proc. 23rd international conference on Machine learning, 148, 97-104.
1 2 3 4 5
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.