On the use of neighbourhood-based non-parametric classifiers
Pattern Recognition Letters - special issue on pattern recognition in practice V
The String-to-String Correction Problem
Journal of the ACM (JACM)
A Theoretical Study on Six Classifier Fusion Strategies
IEEE Transactions on Pattern Analysis and Machine Intelligence
Proceedings of the 17th International Conference on Data Engineering
Data mining tasks and methods: Classification: nearest-neighbor approaches
Handbook of data mining and knowledge discovery
High Performance Data Mining Using the Nearest Neighbor Join
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
An Overview and Comparison of Voting Methods for Pattern Recognition
IWFHR '02 Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02)
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Combining Pattern Classifiers: Methods and Algorithms
Combining Pattern Classifiers: Methods and Algorithms
Hi-index | 0.00 |
The k-nearest-neighbor rule is a well known pattern recognition technique with very good results in a great variety of real classification tasks. Based on the neighborhood concept, several classification rules have been proposed to reduce the error rate of the k-nearest-neighbor rule (or its time requirements). In this work, two new geometrical neighborhoods are defined and the classification rules derived from them are used in several real data classification tasks. Also, some voting ensembles of classifiers based on these new rules have been tested and compared.