Publisher
Springer Science and Business Media LLC
Reference38 articles.
1. Bentley JL. Multidimensional binary search trees used for associative searching. Commun ACM. 1975;18(9):509–17. https://doi.org/10.1145/361002.361007.
2. Omohundro SM. Five balltree construction algorithms. Technical Report TR-89-063, International Computer Science Institute (December 1989)
3. Uhlmann JK. Satisfying general proximity/similarity queries with metric trees. Inf Process Lett. 1991;40(4):175–9.
4. Weber R, Schek H-J, Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24rd International Conference on Very Large Data Bases. VLDB ’98, pp. 194–205. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA 1998. http://dl.acm.org/citation.cfm?id=645924.671192.
5. Garcia S, Derrac J, Cano J, Herrera F. Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans Pattern Anal Mach Intell. 2012;34(3):417–35. https://doi.org/10.1109/TPAMI.2011.142.