High-Dimensional Binary Pattern Classification by Scalar Neural Network Tree
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.
KeywordsNearest neighbor searching perceptron search tree hierarchical classifier multi-class classification
Unable to display preview. Download preview PDF.
- 2.Liu, T., Moore, A.W., Gray, A., Yang, K.: An Investigation of Practical Approximate Nearest Neighbor Algorithms. In: Proceeding of the Conference on Neural Information Processing Systems (2004)Google Scholar
- 3.Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proc. 30th STOC, pp. 604–613 (1998)Google Scholar
- 4.Beis, J.S., Lowe, D.G.: Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1000–1006 (1997)Google Scholar