Nearest neighbor pattern classification
โ Scribed by Cover, T.; Hart, P.
- Book ID
- 111910242
- Publisher
- IEEE
- Year
- 1967
- Tongue
- English
- Weight
- 1020 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0018-9448
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
k-nearest neighbor (k-NN) classiรฟcation is a well-known decision rule that is widely used in pattern classiรฟcation. However, the traditional implementation of this method is computationally expensive. In this paper we develop two e ective techniques, namely, template condensing and preprocessing, to
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
A novel neuralnet-based method of constructing optimized prototypes for nearest-neighbor classiรฟers is proposed. Based on an e ective classiรฟcation oriented error function containing class classiรฟcation and class separation components, the corresponding prototype and feature weight update rules are
A technique is presented for adopting nearest-neighbor classification to the case of categorical variables. The set of categories is mapped onto the real line in such a way as to maximize the ratio of total sum of squares to within-class sum of squares, aggregated over classes. The resulting real va