The paper offers an algorithm (SNN-tree) that extends the binary tree search algorithm so that it can deal with distorted input vectors. Perceptrons are the tree nodes. The algorithm features an iterative solution search and stopping criterion. Unlike the SNN-tree algorithm, popular methods (LSH, k-d tree, BBF-tree, spill-tree) stop working as the dimensionality of the space grows (N > 1000). With such high dimensionality, our algorithm works 7 times faster than the exhaustive search algorithm. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Kryzhanovsky, V., Malsagov, M., Tomas, J. A. C., & Zhelavskaya, I. (2014). High-dimensional binary pattern classification by scalar neural network tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8681 LNCS, pp. 169–176). Springer Verlag. https://doi.org/10.1007/978-3-319-11179-7_22
Mendeley helps you to discover research relevant for your work.