Computational geometry: an introduction
Computational geometry: an introduction
An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
A sample set condensation algorithm for the class sensitive artificial neural network
Pattern Recognition Letters
A Fast Algorithm for the Nearest-Neighbor Classifier
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the use of neighbourhood-based non-parametric classifiers
Pattern Recognition Letters - special issue on pattern recognition in practice V
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Machine Learning
A Voronoi-Diagram-Based Approach to Oblique Decision Tree Induction
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
Finding Prototypes For Nearest Neighbor Classifiers
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper describes an algorithm to design a tree-structured classifier with the hyperplanes associated with a set of prototypes. The main purpose of this technique consists of defining a classification scheme whose result is close to that produced by the Nearest Neighbour decision rule, but getting important computation savings during classification.