Non-parametric Nearest Neighbor with Local Adaptation

Authors:
Francisco J. Ferrer-Troyano;Jesús S. Aguilar-Ruiz;José Cristóbal Riquelme Santos
Affiliations:
-;-;-
Venue:
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Year:
2001

Citing 7
Cited 0

Instance-Based Learning Algorithms

Machine Learning
C4.5: programs for machine learning

C4.5: programs for machine learning
A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features

Machine Learning
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets

Machine Learning
An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A study of distance-based machine learning algorithms

A study of distance-based machine learning algorithms
Improved heterogeneous distance functions

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k-Nearest Neighbor algorithm (k-NN) uses a classification criterion that depends on the parameter k. Usually, the value of this parameter must be determined by the user. In this paper we present an algorithm based on the NN technique that does not take the value of k from the user. Our approach evaluates values of k that classified the training examples correctly and takes which classified most examples. As the user does not take part in the election of the parameter k, the algorithm is non-parametric. With this heuristic, we propose an easy variation of the k-NN algorithm that gives robustness with noise present in data. Summarized in the last section, the experiments show that the error rate decreases in comparison with the k-NN technique when the best k for each database has been previously obtained.