Fuzzy sets in pattern recognition: methodology and methods
Pattern Recognition
Artificial Intelligence
On optimum choice of k in nearest neighbor classification
Computational Statistics & Data Analysis
Analysis of evidence-theoretic decision rules for pattern classification
Pattern Recognition
An evidence-theoretic k-NN rule with parameter optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.00 |
In this paper, a robust adaptive version of evidence theoretic k-NN classification rule was proposed. In the robust rule, an adaptive distance metric was proposed to be used instead of the Euclidean distance metric. All the parameters brought in by the proposed adaptive distance metric and some other important structural parameters fixed in the original rule are optimized based on training set by means of gradient-descent algorithm. In addition, a new error criterion and also an extended form of combination rule were proposed to be applied. Some popular sets of data were applied to validate the robust adaptive version of evidence-theoretic rule, and the results suggest that the robust one outperforms the original one.