A new nearest-neighbor rule in the pattern classification problem
โ Scribed by Kazuo Hattori; Masahito Takahashi
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 102 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
โฆ Synopsis
A new nearest-neighbor (NN) rule is proposed. In this rule, the k-nearest neighbors of an input sample are obtained in each class. Two classification examples are presented to test the NN rule proposed. The number of samples misclassified N is evaluated. The minimum of N in the the NN rule proposed is found to be nearly equal to or less than those in the k-NN, distance-weighted k-NN and fuzzy k-NN rules. The NN rule proposed is shown to be very flexible. It will yield good classification results, if the parameters introduced in it are optimized.
๐ SIMILAR VOLUMES
A new methodology, a Kullback Leibler-nearest neighbor (KL-NIV) rule method is introduced for the EEG population screening problem. It is applied to the classification of anesthesia levels of humans in surgery by the analysis of EEGs alone. Stationary epoch multichannel EEGs are considered. In the E