K nearest neighbor classification with local induction of the simple value difference metric

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

Abstract

The classical k nearest neighbor (k-nn) classification assumes that a fixed global metric is denned and searching for nearest neighbors is always based on this global metric. In the paper we present a model with local induction of a metric. Any test object induces a local metric from the neighborhood of this object and selects k nearest neighbors according to this locally induced metric. To induce both the global and the local metric we use the weighted Simple Value Difference Metric (SVDM). The experimental results show that the proposed classification model with local induction of a metric reduces classification error up to several times in comparison to the classical k-nn method.

Cite

CITATION STYLE

APA

Skowron, A., & Wojna, A. (2004). K nearest neighbor classification with local induction of the simple value difference metric. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3066, pp. 229–234). Springer Verlag. https://doi.org/10.1007/978-3-540-25929-9_27

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