Abstract
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. It suffers, however, from a number of limitations, i.e., high computational complexity, a potential loss of accuracy when a small set of prototypes is used and sensitivity to noise. To overcome these shortcomings, we propose to use a normal density-based classifier constructed on the same representation. We show that such a classifier, based on a weighted combination of dissimilarities, can significantly improve the nearest neighbor rule with respect to the recognition accuracy and computational effort. © 2002 Elsevier Science B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 943-956 |
Number of pages | 13 |
Journal | Pattern Recognition Letters |
Volume | 23 |
Issue number | 8 |
DOIs | |
Publication status | Published - Jun 2002 |
Keywords
- Normal density-based classifiers
- Similarity representations