Abstract
The (k, s)-perceptrons partition the input space {0, ..., k-1}n into s+1 regions using s parallel hyperplanes. Their learning abilities are examined in this paper. The previously studied homogeneous (k, k-1)-perceptron learning algorithm is generalized to the permutably homogeneous (k, s)-perceptron learning algorithm with guaranteed convergence property. We also introduce a powerful learning method that learns any permutably homogeneously separable k-valued logic function given as input.
| Original language | English |
|---|---|
| Pages (from-to) | 161-166 |
| Number of pages | 6 |
| Journal | Proceedings of The International Symposium on Multiple-Valued Logic |
| State | Published - 1998 |
| Event | Proceedings of the 1998 28th International Symposium on Multiple-Valued Logic - Fukuoka, Jpn Duration: May 27 1998 → May 29 1998 |
ASJC Scopus Subject Areas
- General Computer Science
- General Mathematics
Fingerprint
Dive into the research topics of 'Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS