Nearest neighbour distance matrix classification
A distance based classification is one of the popular methods for classifying instances using a point-to-point distance based on the nearest neighbour or k-NEAREST NEIGHBOUR (k-NN).The representation of distance measure can be one of the various measures available (e.g. Euclidean distance, Manhattan...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Springer
2010
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/12419/ http://dx.doi.org/10.1007/978-3-642-17316-5_11 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A distance based classification is one of the popular methods for classifying instances using a point-to-point distance based on the nearest neighbour or k-NEAREST NEIGHBOUR (k-NN).The representation of distance measure can be one of the various measures available (e.g. Euclidean distance, Manhattan distance, Mahalanobis distance or other specific distance measures).In this paper, we propose a modified nearest neighbour method called Nearest Neighbour Distance Matrix (NNDM) for classification based on unsupervised and supervised distance matrix.In the proposed NNDM method, an Euclidean distance method coupled with a distance loss function is used to create a distance matrix. In our approach, distances of each instance to the rest of the training instances data will be used to create the training distance matrix (TADM). Then, the TADM will be used to classify a new instance.In supervised NNDM, two instances that belong to different classes will be pushed apart from each other. This is to ensure that the instances that are located next to each other belong to the same class. Based on the experimental results, we found that the trained distance matrix yields reasonable performance in classification. |
|---|