A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
Extension to C-means Algorithm for the Use of Similarity Functions
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Some approaches to improve tree-based nearest neighbour search algorithms
Pattern Recognition
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
A Data Structure and an Algorithm for the Nearest Point Problem
IEEE Transactions on Software Engineering
Improved heterogeneous distance functions
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The nearest neighbor (NN) classifier has been a widely used technique in pattern recognition because of its simplicity and good behavior. To decide the class of a new object, the NNclassifier performs an exhaustive comparison between the object to classify and the training set T. However, when Tis large, the exhaustive comparison is very expensive and sometimes becomes inapplicable. To avoid this problem, many fast NNalgorithms have been developed for numerical object descriptions, most of them based on metric properties to avoid comparisons. However, in some sciences as Medicine, Geology, Sociology, etc., objects are usually described by numerical and non numerical attributes (mixed data). In this case, we can not assume the comparison function satisfies metric properties. Therefore, in this paper a fast most similar object classifier based on search methods suitable for mixed data is presented. Some experiments using standard databases and a comparison with other two fast NNmethods are presented.