Abstract
In this paper, we develop a novel Distance-weighted k-nearest Neighbor rule (DWKNN), using the dual distance-weighted function. The proposed DWKNN is motivated by the sensitivity problem of the selection of the neighborhood size k that exists in k-nearest Neighbor rule (KNN), with the aim of improving classification performance. The experiment results on twelve real data sets demonstrate that our proposed classifier is robust to different choices of k to some degree, and yields good performance with a larger optimal k, compared to the other state-of-art KNN-based methods.
| Original language | English |
|---|---|
| Pages (from-to) | 1429-1436 |
| Number of pages | 8 |
| Journal | Journal of Information and Computational Science |
| Volume | 9 |
| Issue number | 6 |
| Publication status | Published - Jun 2012 |
Keywords
- K-nearest neighbor rule
- Pattern classification
- Weighted voting
Fingerprint
Dive into the research topics of 'A new distance-weighted k-nearest neighbor classifier'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver