Improving k-NN by using fuzzy similarity functions

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The k-Nearest Neighbor (k-NN) is the basis for many lazy learning algorithms. It uses a similarity function to generate predictions from stored instances. Many authors have shown that the performance of k-NN is highly sensitive to the definition of its metric similarity. In this paper we propose the use of the fuzzy set theory in the definition of similarity functions. We present experiments with a real application to demonstrate the usefulness of this approach. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Morell, C., Bello, R., & Grau, R. (2004). Improving k-NN by using fuzzy similarity functions. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3315, pp. 708–716). Springer Verlag. https://doi.org/10.1007/978-3-540-30498-2_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free