The Nearest Neighbor Algorithm of Local Probability Centers
Authors:
- 16 January 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 38 (1) , 141-154
Abstract
When classes are nonseparable or overlapping, training samples in a local neighborhood may come from different classes. In this situation, the samples with different class labels may be comparable in the neighborhood of query. As a consequence, the conventional nearest neighbor classifier, such as -nearest neighbor scheme, may produce a wrong prediction. To address this issue, in this paper, we propose a new classification method, which performs a classification task based on the local probabilistic centers of each class. This method works by reducing the number of negative contributing points, which are the known samples falling on the wrong side of the ideal decision boundary, in a training set and by restricting their influence regions. In classification, this method classifies the query sample by using two measures of which one is the distance between the query and the local categorical probability centers, and the other is the computed posterior probability of the query. Although both measures are effective, the experiments show that the second one achieves the smaller classification error. Meanwhile, the theoretical analyses of the suggested methods are investigated, and some experiments are conducted on the basis of both constructed and real datasets. The investigation results show that this method substantially improves the classification performance of the nearest neighbor algorithm.Keywords
This publication has 23 references indexed in Scilit:
- Multiscale Classification Using Nearest Neighbor Density EstimatesIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2006
- The nearest subclass classifier: a compromise between the nearest mean and nearest neighbor classifierIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- A Statistical Approach to Texture Classification from Single ImagesInternational Journal of Computer Vision, 2005
- General conditions for predictivity in learning theoryNature, 2004
- Adaptive quasiconformal kernel nearest neighbor classificationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- On the "dimensionality curse" and the "self-similarity blessing"IEEE Transactions on Knowledge and Data Engineering, 2001
- Discriminant adaptive nearest neighbor classificationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Texture features for browsing and retrieval of image dataIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- A k-nearest neighbor classification rule based on Dempster-Shafer theoryIEEE Transactions on Systems, Man, and Cybernetics, 1995
- The optimal distance measure for nearest neighbor classificationIEEE Transactions on Information Theory, 1981