Author:
Kislitsyn A. A.,Orlov Yu. N.
Reference16 articles.
1. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning (Springer, New York, 2001).
2. G.H. Chen and D. Shah, “Explaining the success of nearest neighbor methods in prediction,’’ Found. Trends Mach. Learn. 10, 337–588 (2018).
3. G. L. Miller, S. Teng,W. Thurston, and S. A. Vavasis, ‘‘Separators for sphere-packings and nearest neighbor graphs,’’ J. ACM 44, 1–29 (1997).
4. D. Eppstein, M. Paterson, and F. Yao, “On nearest-neighbor graphs,’’ Discrete Comput. Geom. 17, 263 (1992).
5. D. Baranchuk, D. Persiyanov, A. Sinitsin, and A. Babenko, ‘‘Learning to routein similarity graphs,’’ in Proceedings of the International Conference on Machine Learning (2019), pp. 475–484.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献