Abstract
Many computer scientists doubted ad hoc methods would ever give way to a more general approach to finding nearest neighbors. They were wrong.
Index Terms
- Good algorithms make good neighbors
Recommendations
Nonsystematic Search and No-Good Learning
Nonsystematic search algorithms seem, in general, to be well suited to large-scale problems with many solutions. However, they tend to perform badly for problems with few solutions, and they cannot be used for insoluble problems, since they are ...
Kernel Difference-Weighted k-Nearest Neighbors Classification
ICIC '07: Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial IntelligenceNearest Neighbor (NN) rule is one of the simplest and most important methods in pattern recognition. In this paper, we propose a kernel difference-weighted <em>k</em>-nearest neighbor method (KDF-WKNN) for pattern classification. The proposed method ...
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern RecognitionMany pattern recognition tasks make use of the k nearest neighbour (k-NN) technique. In this paper we are interested on fast k- NN search algorithms that can work in any metric space i.e. they are not restricted to Euclidean-like distance functions. ...
Comments