๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing nearest neighbor pattern classification perceptrons

โœ Scribed by Owen Murphy; Bert Brooks; Thomas Kite


Book ID
107766582
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
566 KB
Volume
83
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Improved k-nearest neighbor classificati
โœ Yingquan Wu; Krassimir Ianakiev; Venu Govindaraju ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 113 KB

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 rule in the patte
โœ Kazuo Hattori; Masahito Takahashi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

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

Prototype optimization for nearest-neigh
โœ Y.S. Huang; C.C. Chiang; J.W. Shieh; E. Grimson ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

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