Neural Minimal Distance Methods (1997)
by
Włodzisław Duch
| Venue: | PROC. 3-RD CONF. ON NEURAL NETWORKS AND THEIR APPLICATIONS |
| Citations: | 13 - 12 self |
BibTeX
@INPROCEEDINGS{Duch97neuralminimal,
author = {Włodzisław Duch},
title = {Neural Minimal Distance Methods},
booktitle = {PROC. 3-RD CONF. ON NEURAL NETWORKS AND THEIR APPLICATIONS},
year = {1997},
pages = {14--18},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Minimal distance methods are simple and in some circumstances highly accurate. In this paper relations between neural and minimal distance methods are investigated. Neural realization facilitates new versions of minimal distance methods. Parametrization of distance functions, distance-based weighting of neighbors, active selection of reference vectors from the training set and relations to the case-based reasoning are discussed.
Citations
| 79 | A neural model for category learning - Reilly, Cooper, et al. - 1982 |
| 59 | Pattern recognition and neural networks. Cambridge (United Kingdom - Ripley - 1996 |
| 13 | Classification with Learning k-Nearest Neighbors - Laaksonen, Oja - 1996 |
| 12 | eds, Handbook of statistics 2: classification, pattern recognition and reduction of dimensionality (North - Krishnaiah, Kanal - 1982 |
| 9 | Advanced methods in neural networks - Wasserman - 1993 |
| 4 | The convergence of Hamming memory networks - Floreen - 1991 |
| 3 | A Theoretical and Experimental Accountof n-tuple - Rohwer, Morciniec - 1996 |
| 2 | An Introduction to Computingwith Neural Nets - Lippmann - 1987 |
