Author:
Lu Tong,Qi Zhiwei,Yue Kun,Duan Liang
Publisher
Springer Nature Switzerland
Reference30 articles.
1. Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., Schmidt, L.: Practical and optimal lsh for angular distance. In: Advances in Neural Information Processing Systems, 28 (2015)
2. Bernhardsson, E.: Annoy at github. GitHub. Repéré à https://github.com/spotify/annoy (2015)
3. Bi, W., Ma, J., Zhu, X., Wang, W., Zhang, A.: Cloud service selection based on weighted KD tree nearest neighbor search. Appl. Soft Comput. J. 131, 109780 (2022)
4. Cheng, D., Huang, J., Zhang, S., Wu, Q.: A robust method based on locality sensitive hashing for k-nearest neighbors searching. Wireless Networks, pp. 1–14 (2022)
5. Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th international conference on World wide web, pp. 577–586 (2011)